All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
heur_veclendiving.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. Vectorlength Diving chooses the variable with the smallest ratio of potential
23 * objective change and number of affected constraints and fixes it. One-level backtracking is applied: If the LP gets
24 * infeasible, the last fixings is undone, and the opposite fixing is tried. If this is infeasible, too, the procedure
|