Solving Constraint Integer Programs

heur_intshifting.h File Reference

Detailed Description

LP rounding heuristic that tries to recover from intermediate infeasibilities, shifts integer variables, and solves a final LP to calculate feasible values for continuous variables.

Tobias Achterberg

This heuristic is similar to the Shifting heuristic (see heur_shifting.h), but it ignores continuous variables during the shifting phase and solves a final LP to find feasible (and optimal w.r.t. the integer fixings) values for the continuous variables.

Definition in file heur_intshifting.h.

#include "scip/def.h"
#include "scip/type_retcode.h"
#include "scip/type_scip.h"

Go to the source code of this file.


SCIP_RETCODE SCIPincludeHeurIntshifting (SCIP *scip)