heur_trivial.h
Go to the documentation of this file.
30 * pre-root heuristic that tries some trivial (but often feasibile) solutions: all variables at their upper bounds, all
31 * variables at their lower bounds, all variables zero, all variables at the bound with the fewer locks. This will,
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