heur_rens.h
Go to the documentation of this file.
30 * RENS is a large neighborhood search start heuristic, i.e., unlike other LNS heuristics, it does not need a known
31 * feasible solution. It solves a sub-SCIP that is created by fixing variables which take an integral value in a given
32 * LP or NLP solution. For the remaining integer variables, the bounds get tightened to the two nearest integral values.
35 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:68
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)
Definition: heur_rens.c:603
type definitions for return codes for SCIP methods
type definitions for primal heuristics
type definitions for SCIP's main datastructure
Definition: struct_heur.h:97
result codes for SCIP callback methods
common defines and data types used in all packages of SCIP
Definition: objbenders.h:43