SCIP
Solving Constraint Integer Programs
Solving Constraint Integer Programs
|
heur_trivial.h File Reference Detailed Descriptiontrivial primal heuristic pre-root heuristic that tries some trivial (but often feasibile) solutions: all variables at their upper bounds, all variables at their lower bounds, all variables zero, all variables at the bound with the fewer locks. This will, e.g., find a start solution for all pure set covering or set packing problems. Definition in file heur_trivial.h. #include "scip/scip.h"Go to the source code of this file.
Function Documentation
creates the trivial primal heuristic and includes it in SCIP
|
|||||||||||||||
