heur_rins.h
Go to the documentation of this file.
30 * RINS is a large neighborhood search improvement heuristic, i.e., it requires a known feasible solution. It solves a
31 * sub-SCIP that is created by fixing variables which take the same value in the incumbent and the current node's LP
35 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:68
type definitions for return codes for SCIP methods
type definitions for SCIP's main datastructure
common defines and data types used in all packages of SCIP
Definition: objbenders.h:43