DINS primal heuristic.
DINS combines the ideas of RINS (see heur_rins.h) and Local Branching (see heur_localbranching.h). 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_dins.h.
|SCIP_RETCODE||SCIPincludeHeurDins (SCIP *scip)|