Scippy

    SCIP

    Solving Constraint Integer Programs

    Functions
    heur_shifting.h File Reference
    Public API of SCIP » Plugin API of SCIP » Primal Heuristics

    Detailed Description

    LP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables.

    Author
    Tobias Achterberg

    This heuristic is similar to the Rounding heuristic (see heur_rounding.h), but it tries to continue in the case that no rounding can decrease the violation of a linear constraint. In this case, the value of a continuous variable or an integer variable with integral value will be shifted in order to decrease the violation of the constraint. To avoid cycling, the procedure terminates after a certain number of non-improving shifts.

    Definition in file heur_shifting.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 SCIPincludeHeurShifting (SCIP *scip)