heur_coefdiving.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. Coefficient Diving chooses the variable with the fewest locking number in any 23 * direction and rounds it into this direction. One-level backtracking is applied: If the LP gets infeasible, the last 24 * fixing is undone, and the opposite fixing is tried. If this is infeasible, too, the procedure aborts. 27 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
SCIP_RETCODE SCIPincludeHeurCoefdiving(SCIP *scip) Definition: objbranchrule.h:33 SCIP callable library. |