Scippy

SCIP

Solving Constraint Integer Programs

Functions
heur_intshifting.h File Reference
Primal Heuristics

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.

Author
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/scip.h"

Go to the source code of this file.

Functions

SCIP_RETCODE SCIPincludeHeurIntshifting (SCIP *scip)
 

Function Documentation

SCIP_RETCODE SCIPincludeHeurIntshifting ( SCIP *  scip)

creates the intshifting heuristic and includes it in SCIP

creates the intshifting heuristic with infeasibility recovering and includes it in SCIP

Parameters
scipSCIP data structure

Definition at line 1007 of file heur_intshifting.c.

References HEUR_DESC, HEUR_DISPCHAR, HEUR_FREQ, HEUR_FREQOFS, HEUR_MAXDEPTH, HEUR_NAME, HEUR_PRIORITY, HEUR_TIMING, HEUR_USESSUBSCIP, NULL, SCIP_CALL, SCIP_OKAY, SCIPincludeHeurBasic(), SCIPsetHeurCopy(), SCIPsetHeurExit(), SCIPsetHeurInit(), and SCIPsetHeurInitsol().

Referenced by SCIP_DECL_HEURCOPY(), and SCIPincludeDefaultPlugins().