Detailed Description
master LP diving heuristic that chooses fixings w.r.t. the fractionalities
Diving heuristic: Iteratively fixes some fractional variable and resolves the LP-relaxation, thereby simulating a depth-first-search in the tree. Fractional Diving chooses the variable with the highest fractionality and rounds it to the nearest integer. One-level backtracking is applied: If the LP gets infeasible, the last fixing is undone, and the opposite fixing is tried. If this is infeasible, too, the procedure aborts.
Definition in file heur_masterfracdiving.h.
#include "scip/scip.h"
Go to the source code of this file.
Functions | |
SCIP_EXPORT SCIP_RETCODE | GCGincludeHeurMasterfracdiving (SCIP *scip) |
Function Documentation
◆ GCGincludeHeurMasterfracdiving()
SCIP_EXPORT SCIP_RETCODE GCGincludeHeurMasterfracdiving | ( | SCIP * | scip | ) |
creates the masterfracdiving heuristic and includes it in GCG
Definition at line 179 of file heur_masterfracdiving.c.
References GCGincludeDivingHeurMaster(), HEUR_DESC, HEUR_DISPCHAR, HEUR_FREQ, HEUR_FREQOFS, HEUR_MAXDEPTH, HEUR_NAME, and HEUR_PRIORITY.
Referenced by GCGincludeMasterPlugins().