Scippy

SCIP

Solving Constraint Integer Programs

Functions
heur_shifting.h File Reference
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/scip.h"

Go to the source code of this file.

Functions

SCIP_RETCODE SCIPincludeHeurShifting (SCIP *scip)
 

Function Documentation

SCIP_RETCODE SCIPincludeHeurShifting ( SCIP *  scip)

creates the shifting heuristic and includes it in SCIP

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

Parameters
scipSCIP data structure

Definition at line 947 of file heur_shifting.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().