heur_pscostdiving.h
Go to the documentation of this file.
21 * Diving heuristic: Iteratively fixes some fractional variable and resolves the LP-relaxation, thereby simulating a 22 * depth-first-search in the tree. Pseudocost Diving chooses the variable with the smallest ratio of estimated objective 23 * increase if rounding to either direction. If the variable is significantly different from its root LP vlaue, it will 24 * be rounded into the direction it developed (see @ref heur_linesearchdiving.h), if it is close to an integral point, 25 * it will be rounded to that one, otherwise it will be rounded into the direction of lower pseudocosts. One-level 26 * backtracking is applied: If the LP gets infeasible, the last fixing is undone, and the opposite fixing is tried. If 30 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
SCIP_RETCODE SCIPincludeHeurPscostdiving(SCIP *scip) Definition: objbranchrule.h:33 SCIP callable library. |