All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
heur_undercover.h File Reference Detailed DescriptionUndercover primal heuristic for MINLPs. The undercover heuristic is designed for mixed-integer nonlinear programs and tries to fix a subset of variables such as to make each constraint linear or convex. For this purpose it solves a binary program to automatically determine the minimum number of variable fixings necessary. As fixing values, we use values from the LP relaxation, the NLP relaxation, or the incumbent solution. Definition in file heur_undercover.h. #include "scip/scip.h" Go to the source code of this file.
Function Documentation
creates the undercover primal heuristic and includes it in SCIP
computes a minimal set of covering variables
|