heur_undercover.h
Go to the documentation of this file.
31 * The undercover heuristic is designed for mixed-integer nonlinear programs and tries to fix a subset of variables such
32 * as to make each constraint linear or convex. For this purpose it solves a binary program to automatically determine
33 * the minimum number of variable fixings necessary. As fixing values, we use values from the LP relaxation, the NLP
37 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
70 SCIP_VAR** cover, /**< pointer to store the variables (of the original SCIP) in the computed cover
75 SCIP_Bool globalbounds, /**< should global bounds on variables be used instead of local bounds at focus node? */
Definition: struct_scip.h:68
Definition: struct_var.h:207
type definitions for return codes for SCIP methods
type definitions for SCIP's main datastructure
type definitions for problem variables
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)
Definition: heur_undercover.c:3320
SCIP_RETCODE SCIPincludeHeurUndercover(SCIP *scip)
Definition: heur_undercover.c:3095
common defines and data types used in all packages of SCIP
Definition: objbenders.h:43