Scippy

    SCIP

    Solving Constraint Integer Programs

    Detailed Description

    trivial primal heuristic

    Author
    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/def.h"
    #include "scip/type_retcode.h"
    #include "scip/type_scip.h"

    Go to the source code of this file.

    Functions

    SCIP_RETCODE SCIPincludeHeurTrivial (SCIP *scip)