SCIP
Solving Constraint Integer Programs
Solving Constraint Integer Programs
|
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
heur_shifting.h File Reference Detailed DescriptionLP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables. 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.
Function Documentation
creates the shifting heuristic and includes it in SCIP
|
|||||||||||||||
