All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
heur_undercover.h
Go to the documentation of this file.
22 * The undercover heuristic is designed for mixed-integer nonlinear programs and tries to fix a subset of variables such
23 * as to make each constraint linear or convex. For this purpose it solves a binary program to automatically determine
24 * the minimum number of variable fixings necessary. As fixing values, we use values from the LP relaxation, the NLP
28 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
50 SCIP_VAR** cover, /**< pointer to store the variables (of the original SCIP) in the computed cover
55 SCIP_Bool globalbounds, /**< should global bounds on variables be used instead of local bounds at focus node? */
SCIP_RETCODE SCIPcomputeCoverUndercover(SCIP *scip, int *coversize, SCIP_VAR **cover, SCIP_Real timelimit, SCIP_Real memorylimit, SCIP_Real objlimit, SCIP_Bool globalbounds, SCIP_Bool onlyconvexify, SCIP_Bool coverbd, char coveringobj, SCIP_Bool *success) SCIP_RETCODE SCIPincludeHeurUndercover(SCIP *scip) SCIP callable library. |