Detailed Description
master LP diving heuristic that fixes variables with a large difference to their root solution
Diving heuristic: Iteratively fixes some fractional variable and resolves the LP-relaxation, thereby simulating a depth-first-search in the tree. Line search diving chooses the variable with the greatest difference of its root LP solution and the current LP solution, hence, the variable that developed most. It is fixed to the next integer in the direction it developed. 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_masterlinesdiving.h.
#include "scip/scip.h"
Go to the source code of this file.
Functions | |
SCIP_EXPORT SCIP_RETCODE | GCGincludeHeurMasterlinesdiving (SCIP *scip) |
Function Documentation
◆ GCGincludeHeurMasterlinesdiving()
SCIP_EXPORT SCIP_RETCODE GCGincludeHeurMasterlinesdiving | ( | SCIP * | scip | ) |
creates the masterlinesdiving primal heuristic and includes it in GCG
creates the masterlinesdiving heuristic and includes it in GCG
Definition at line 139 of file heur_masterlinesdiving.c.
References GCGincludeDivingHeurMaster(), HEUR_DESC, HEUR_DISPCHAR, HEUR_FREQ, HEUR_FREQOFS, HEUR_MAXDEPTH, HEUR_NAME, and HEUR_PRIORITY.
Referenced by GCGincludeMasterPlugins().