Solving Constraint Integer Programs

Detailed Description

DINS primal heuristic.

Robert Waniek

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.

#include "scip/def.h"
#include "scip/type_retcode.h"
#include "scip/type_scip.h"

Go to the source code of this file.


SCIP_RETCODE SCIPincludeHeurDins (SCIP *scip)