All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
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,
|