LNS heuristic that combines the incumbent with the LP optimum.
RINS is a large neighborhood search improvement heuristic, i.e., it requires a known feasible solution. It solves a sub-SCIP that is created by fixing variables which take the same value in the incumbent and the current node's LP relaxation.
Definition in file heur_rins.h.
|SCIP_RETCODE||SCIPincludeHeurRins (SCIP *scip)|