heur_trivial.h
Go to the documentation of this file.
21 * pre-root heuristic that tries some trivial (but often feasibile) solutions: all variables at their upper bounds, all 22 * variables at their lower bounds, all variables zero, all variables at the bound with the fewer locks. This will, 26 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
SCIP_RETCODE SCIPincludeHeurTrivial(SCIP *scip) Definition: objbranchrule.h:33 SCIP callable library. |