Scippy

SCIP

Solving Constraint Integer Programs

Detailed Description

LNS heuristic that finds the optimal rounding to a given point.

Author
Timo Berthold

RENS is a large neighborhood search start heuristic, i.e., unlike other LNS heuristics, it does not need a known feasible solution. It solves a sub-SCIP that is created by fixing variables which take an integral value in a given LP or NLP solution. For the remaining integer variables, the bounds get tightened to the two nearest integral values.

Definition in file heur_rens.h.

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

Go to the source code of this file.

Functions

SCIP_RETCODE SCIPincludeHeurRens (SCIP *scip)
 
SCIP_RETCODE SCIPapplyRens (SCIP *scip, SCIP_HEUR *heur, SCIP_RESULT *result, SCIP_Real minfixingrate, SCIP_Real minimprove, SCIP_Longint maxnodes, SCIP_Longint nstallnodes, char startsol, SCIP_Bool binarybounds, SCIP_Bool uselprows)