Home
last modified time | relevance | path

Searched refs:lpstateforkdepth (Results 1 – 4 of 4) sorted by relevance

/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dheur.h185 int lpstateforkdepth, /**< depth of the last node with solved LP */
196 int lpstateforkdepth, /**< depth of the last node with solved LP */
H A Dheur.c1180 int lpstateforkdepth, /**< depth of the last node with solved LP */ in SCIPheurShouldBeExecuted() argument
1201 != (lpstateforkdepth + heur->freq - heur->freqofs) / heur->freq)); in SCIPheurShouldBeExecuted()
1244 int lpstateforkdepth, /**< depth of the last node with solved LP */ in SCIPheurExec() argument
1269 execute = SCIPheurShouldBeExecuted(heur, depth, lpstateforkdepth, heurtiming, &delayed); in SCIPheurExec()
H A Dtree.c3548 int lpstateforkdepth; in SCIPtreeLoadLPState() local
3579 lpstateforkdepth = (int) lpstatefork->depth; in SCIPtreeLoadLPState()
3580 …assert(lpstateforkdepth < tree->pathlen-1); /* lpstatefork must not be the last (the focus) node o… in SCIPtreeLoadLPState()
3581 …assert(lpstateforkdepth <= tree->correctlpdepth); /* LP must have been constructed at least up to … in SCIPtreeLoadLPState()
3582 …assert(tree->pathnlpcols[tree->correctlpdepth] >= tree->pathnlpcols[lpstateforkdepth]); /* LP can … in SCIPtreeLoadLPState()
3583 …assert(tree->pathnlprows[tree->correctlpdepth] >= tree->pathnlprows[lpstateforkdepth]); /* LP can … in SCIPtreeLoadLPState()
3618 && (tree->pathnlprows[tree->correctlpdepth] == tree->pathnlprows[lpstateforkdepth]); in SCIPtreeLoadLPState()
3620 && (tree->pathnlprows[tree->correctlpdepth] == tree->pathnlprows[lpstateforkdepth]); in SCIPtreeLoadLPState()
3622 && (tree->pathnlpcols[tree->correctlpdepth] == tree->pathnlpcols[lpstateforkdepth]); in SCIPtreeLoadLPState()
3624 && (tree->pathnlpcols[tree->correctlpdepth] == tree->pathnlpcols[lpstateforkdepth]); in SCIPtreeLoadLPState()
[all …]
H A Dsolve.c225 int lpstateforkdepth; in SCIPprimalHeuristics() local
294 lpstateforkdepth = -1; in SCIPprimalHeuristics()
303 …lpstateforkdepth = (tree->focuslpstatefork != NULL ? SCIPnodeGetDepth(tree->focuslpstatefork) : -1… in SCIPprimalHeuristics()
346 … if( SCIPheurShouldBeExecuted(set->heurs[h], depth, lpstateforkdepth, heurtiming, &delayed) ) in SCIPprimalHeuristics()
354 …SCIP_CALL( SCIPheurExec(set->heurs[h], set, primal, depth, lpstateforkdepth, heurtiming, nodeinfea… in SCIPprimalHeuristics()