trivial 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.
|SCIP_RETCODE||SCIPincludeHeurTrivial (SCIP *scip)|