heur_linesearchdiving.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. Line search diving chooses the variable with the greatest difference of its root LP
23 * solution and the current LP solution, hence, the variable that developed most. It is fixed to the next integer in
24 * the direction it developed. One-level backtracking is applied: If the LP gets infeasible, the last fixing is undone,
28 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:59
type definitions for return codes for SCIP methods
type definitions for SCIP's main datastructure
SCIP_EXPORT SCIP_RETCODE SCIPincludeHeurLinesearchdiving(SCIP *scip)
Definition: heur_linesearchdiving.c:266
common defines and data types used in all packages of SCIP
Definition: objbenders.h:33