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