Detailed Description
master LP diving heuristic that chooses fixings w.r.t. the matrix coefficients
Diving heuristic: Iteratively fixes some fractional variable and resolves the LP-relaxation, thereby simulating a depth-first-search in the tree. Coefficient Diving chooses the variable with the fewest locking number in any direction and rounds it into this direction. 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_mastercoefdiving.h.
#include "scip/scip.h"
Go to the source code of this file.
Functions | |
SCIP_EXPORT SCIP_RETCODE | GCGincludeHeurMastercoefdiving (SCIP *scip) |
Function Documentation
◆ GCGincludeHeurMastercoefdiving()
SCIP_EXPORT SCIP_RETCODE GCGincludeHeurMastercoefdiving | ( | SCIP * | scip | ) |
creates the mastercoefdiving heuristic and includes it in GCG
Definition at line 187 of file heur_mastercoefdiving.c.
References GCGincludeDivingHeurMaster(), HEUR_DESC, HEUR_DISPCHAR, HEUR_FREQ, HEUR_FREQOFS, HEUR_MAXDEPTH, HEUR_NAME, and HEUR_PRIORITY.
Referenced by GCGincludeMasterPlugins().