heur_masterlinesdiving.h
Go to the documentation of this file.
30 * @brief master LP diving heuristic that fixes variables with a large difference to their root solution
33 * Diving heuristic: Iteratively fixes some fractional variable and resolves the LP-relaxation, thereby simulating a
34 * depth-first-search in the tree. Line search diving chooses the variable with the greatest difference of its root LP
35 * solution and the current LP solution, hence, the variable that developed most. It is fixed to the next integer in
36 * the direction it developed. One-level backtracking is applied: If the LP gets infeasible, the last fixing is undone,
SCIP_EXPORT SCIP_RETCODE GCGincludeHeurMasterlinesdiving(SCIP *scip)
Definition: heur_masterlinesdiving.c:139