Solving Constraint Integer Programs

heur_trivial.h File Reference

Detailed Description

trivial primal heuristic

Timo Berthold

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.


SCIP_RETCODE SCIPincludeHeurTrivial (SCIP *scip)

Function Documentation

SCIP_RETCODE SCIPincludeHeurTrivial ( SCIP scip)

creates the trivial primal heuristic and includes it in SCIP

scipSCIP data structure