Detailed Description
DINS primal heuristic.
DINS combines the ideas of RINS and Local Branching. It defines the neighborhood by introducing a distance function between the incumbent solution and the optimum of the LP relaxation. When applied during a branch-and-bound search, it further takes into account how variables change their values at different nodes of the tree.
Definition in file heur_gcgdins.h.
#include "scip/scip.h"
Go to the source code of this file.
Functions | |
SCIP_EXPORT SCIP_RETCODE | SCIPincludeHeurGcgdins (SCIP *scip) |
Function Documentation
◆ SCIPincludeHeurGcgdins()
SCIP_EXPORT SCIP_RETCODE SCIPincludeHeurGcgdins | ( | SCIP * | scip | ) |
creates the DINS primal heuristic and includes it in SCIP
creates the GCG DINS primal heuristic and includes it in SCIP
Definition at line 1030 of file heur_gcgdins.c.
References DEFAULT_COPYCUTS, DEFAULT_MAXNODES, DEFAULT_MINIMPROVE, DEFAULT_MINNODES, DEFAULT_NEIGHBORHOODSIZE, DEFAULT_NODESOFS, DEFAULT_NODESQUOT, DEFAULT_NWAITINGNODES, DEFAULT_SOLNUM, DEFAULT_USELPROWS, HEUR_DESC, HEUR_DISPCHAR, HEUR_FREQ, HEUR_FREQOFS, HEUR_MAXDEPTH, HEUR_NAME, HEUR_PRIORITY, HEUR_TIMING, and HEUR_USESSUBSCIP.
Referenced by SCIPincludeGcgPlugins().