# SCIP

Solving Constraint Integer Programs

heur_undercover.h
Go to the documentation of this file.
1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2 /* */
3 /* This file is part of the program and library */
4 /* SCIP --- Solving Constraint Integer Programs */
5 /* */
7 /* fuer Informationstechnik Berlin */
8 /* */
10 /* */
12 /* along with SCIP; see the file COPYING. If not visit scipopt.org. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15
16 /**@file heur_undercover.h
17  * @ingroup PRIMALHEURISTICS
18  * @brief Undercover primal heuristic for MINLPs
19  * @author Timo Berthold
20  * @author Ambros Gleixner
21  *
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
25  * relaxation, or the incumbent solution.
26  */
27
28 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
29
30 #ifndef __SCIP_HEUR_UNDERCOVER_H__
31 #define __SCIP_HEUR_UNDERCOVER_H__
32
33 #include "scip/def.h"
34 #include "scip/type_retcode.h"
35 #include "scip/type_scip.h"
36 #include "scip/type_var.h"
37
38 #ifdef __cplusplus
39 extern "C" {
40 #endif
41
42 /** creates the undercover primal heuristic and includes it in SCIP
43  *
44  * @ingroup PrimalHeuristicIncludes
45  */
46 SCIP_EXPORT
48  SCIP* scip /**< SCIP data structure */
49  );
50
52  *
53  * @{
54  */
55
56 /** computes a minimal set of covering variables */
57 SCIP_EXPORT
59  SCIP* scip, /**< SCIP data structure */
60  int* coversize, /**< size of the computed cover */
61  SCIP_VAR** cover, /**< pointer to store the variables (of the original SCIP) in the computed cover
62  * (should be ready to hold SCIPgetNVars(scip) entries) */
63  SCIP_Real timelimit, /**< time limit */
64  SCIP_Real memorylimit, /**< memory limit */
65  SCIP_Real objlimit, /**< objective limit: upper bound on coversize */
66  SCIP_Bool globalbounds, /**< should global bounds on variables be used instead of local bounds at focus node? */
67  SCIP_Bool onlyconvexify, /**< should we only fix/dom.red. variables creating nonconvexity? */
68  SCIP_Bool coverbd, /**< should bounddisjunction constraints be covered (or just copied)? */
69  char coveringobj, /**< objective function of the covering problem ('b'ranching status,
70  * influenced nonlinear 'c'onstraints/'t'erms, 'd'omain size, 'l'ocks,
71  * 'm'in of up/down locks, 'u'nit penalties, constraint 'v'iolation) */
72  SCIP_Bool* success /**< feasible cover found? */
73  );
74
75 /** @} */
76
77 #ifdef __cplusplus
78 }
79 #endif
80
81 #endif
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:54
type definitions for return codes for SCIP methods
type definitions for SCIP&#39;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)
SCIP_RETCODE SCIPincludeHeurUndercover(SCIP *scip)
#define SCIP_Bool
Definition: def.h:84
#define SCIP_Real
Definition: def.h:177
common defines and data types used in all packages of SCIP