Scippy

SCIP

Solving Constraint Integer Programs

cons_orbitope.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 /* */
6 /* Copyright (C) 2002-2019 Konrad-Zuse-Zentrum */
7 /* fuer Informationstechnik Berlin */
8 /* */
9 /* SCIP is distributed under the terms of the ZIB Academic License. */
10 /* */
11 /* You should have received a copy of the ZIB Academic License */
12 /* along with SCIP; see the file COPYING. If not visit scip.zib.de. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15 
16 /**@file cons_orbitope.h
17  * @ingroup CONSHDLRS
18  * @brief constraint handler for (partitioning/packing/full) orbitope constraints w.r.t. the full symmetric group
19  * @author Timo Berthold
20  * @author Marc Pfetsch
21  * @author Christopher Hojny
22  */
23 
24 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
25 
26 #ifndef __SCIP_CONS_ORBITOPE_H__
27 #define __SCIP_CONS_ORBITOPE_H__
28 
29 #include "scip/def.h"
30 #include "scip/type_cons.h"
31 #include "scip/type_retcode.h"
32 #include "scip/type_scip.h"
33 #include "scip/type_var.h"
34 
35 #ifdef __cplusplus
36 extern "C" {
37 #endif
38 
39 
40 /** creates the handler for orbitope constraints and includes it in SCIP
41  *
42  * @ingroup ConshdlrIncludes
43  */
44 extern
46  SCIP* scip /**< SCIP data structure */
47  );
48 
49 /**@addtogroup CONSHDLRS
50  *
51  * @{
52  *
53  * @name Orbitope Constraints
54  *
55  * @{
56  *
57  * This constraint handler can be used to handle symmetries in certain 0/1-programs. The principle
58  * structure is that some variables can be ordered in matrix form, such that permuting columns does
59  * not change the validity and objective function value of a solution. That is, the symmetry group
60  * of the program contains the full symmetric group obtained by permuting the columns of this
61  * matrix. These symmetries can be handled by so-called full orbitopes.
62  *
63  * Moreover, if the variables in each row are contained in set packing or partitioning
64  * constraint, these symmetries can be handled by specialized packing or partitioning orbitopes.
65  *
66  * In more mathematical terms the structure has to be as follows: There are 0/1-variables
67  * \f$x_{ij}\f$, \f$i \in \{1, \dots, p\}\f$, \f$j \in \{1, \dots, q\}\f$. The variables may be coupled
68  * through set packing or partitioning constraints:
69  * \f[
70  * \sum_{j = 1}^q x_{ij} \leq 1 \quad \mbox{or} \quad \sum_{j = 1}^q x_{ij} = 1 \quad \mbox{for all }i = 1, \ldots, p.
71  * \f]
72  * Permuting columns of \f$x\f$ does not change the validity and objective function value of any feasible solution.
73  */
74 
75 /** type of orbitope constraint: full, packing, or partitioning orbitope */
77 {
78  SCIP_ORBITOPETYPE_FULL = 0, /**< constraint is a full orbitope constraint: rowsum(x) unrestricted */
79  SCIP_ORBITOPETYPE_PARTITIONING = 1, /**< constraint is a partitioning orbitope constraint: rowsum(x) == 1 */
80  SCIP_ORBITOPETYPE_PACKING = 2 /**< constraint is a packing orbitope constraint: rowsum(x) <= 1 */
81 };
83 
84 /** creates and captures a orbitope constraint
85  *
86  * @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
87  */
88 extern
90  SCIP* scip, /**< SCIP data structure */
91  SCIP_CONS** cons, /**< pointer to hold the created constraint */
92  const char* name, /**< name of constraint */
93  SCIP_VAR*** vars, /**< matrix of variables on which the symmetry acts */
94  SCIP_ORBITOPETYPE orbitopetype, /**< type of orbitope constraint */
95  int nspcons, /**< number of set partitioning/packing constraints <=> p */
96  int nblocks, /**< number of symmetric variable blocks <=> q */
97  SCIP_Bool resolveprop, /**< should propagation be resolved? */
98  SCIP_Bool initial, /**< should the LP relaxation of constraint be in the initial LP?
99  * Usually set to TRUE. Set to FALSE for 'lazy constraints'. */
100  SCIP_Bool separate, /**< should the constraint be separated during LP processing?
101  * Usually set to TRUE. */
102  SCIP_Bool enforce, /**< should the constraint be enforced during node processing?
103  * TRUE for model constraints, FALSE for additional, redundant constraints. */
104  SCIP_Bool check, /**< should the constraint be checked for feasibility?
105  * TRUE for model constraints, FALSE for additional, redundant constraints. */
106  SCIP_Bool propagate, /**< should the constraint be propagated during node processing?
107  * Usually set to TRUE. */
108  SCIP_Bool local, /**< is constraint only valid locally?
109  * Usually set to FALSE. Has to be set to TRUE, e.g., for branching constraints. */
110  SCIP_Bool modifiable, /**< is constraint modifiable (subject to column generation)?
111  * Usually set to FALSE. In column generation applications, set to TRUE if pricing
112  * adds coefficients to this constraint. */
113  SCIP_Bool dynamic, /**< is constraint subject to aging?
114  * Usually set to FALSE. Set to TRUE for own cuts which
115  * are separated as constraints. */
116  SCIP_Bool removable, /**< should the relaxation be removed from the LP due to aging or cleanup?
117  * Usually set to FALSE. Set to TRUE for 'lazy constraints' and 'user cuts'. */
118  SCIP_Bool stickingatnode /**< should the constraint always be kept at the node where it was added, even
119  * if it may be moved to a more global node?
120  * Usually set to FALSE. Set to TRUE to for constraints that represent node data. */
121  );
122 
123 /** creates and captures an orbitope constraint
124  * in its most basic variant, i. e., with all constraint flags set to their default values, which can be set
125  * afterwards using SCIPsetConsFLAGNAME() in scip.h
126  *
127  * @see SCIPcreateConsOrbitope() for the default constraint flag configuration
128  *
129  * @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
130  */
131 extern
133  SCIP* scip, /**< SCIP data structure */
134  SCIP_CONS** cons, /**< pointer to hold the created constraint */
135  const char* name, /**< name of constraint */
136  SCIP_VAR*** vars, /**< matrix of variables on which the symmetry acts */
137  SCIP_ORBITOPETYPE orbitopetype, /**< type of orbitope constraint */
138  int nspcons, /**< number of set partitioning/packing constraints <=> p */
139  int nblocks, /**< number of symmetric variable blocks <=> q */
140  SCIP_Bool resolveprop /**< should propagation be resolved? */
141  );
142 
143 /* @} */
144 
145 /* @} */
146 
147 #ifdef __cplusplus
148 }
149 #endif
150 
151 #endif
SCIP_RETCODE SCIPcreateConsOrbitope(SCIP *scip, SCIP_CONS **cons, const char *name, SCIP_VAR ***vars, SCIP_ORBITOPETYPE orbitopetype, int nspcons, int nblocks, SCIP_Bool resolveprop, SCIP_Bool initial, SCIP_Bool separate, SCIP_Bool enforce, SCIP_Bool check, SCIP_Bool propagate, SCIP_Bool local, SCIP_Bool modifiable, SCIP_Bool dynamic, SCIP_Bool removable, SCIP_Bool stickingatnode)
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:53
type definitions for return codes for SCIP methods
SCIP_RETCODE SCIPincludeConshdlrOrbitope(SCIP *scip)
type definitions for SCIP&#39;s main datastructure
enum SCIP_OrbitopeType SCIP_ORBITOPETYPE
Definition: cons_orbitope.h:82
type definitions for problem variables
#define SCIP_Bool
Definition: def.h:69
SCIP_OrbitopeType
Definition: cons_orbitope.h:76
SCIP_RETCODE SCIPcreateConsBasicOrbitope(SCIP *scip, SCIP_CONS **cons, const char *name, SCIP_VAR ***vars, SCIP_ORBITOPETYPE orbitopetype, int nspcons, int nblocks, SCIP_Bool resolveprop)
common defines and data types used in all packages of SCIP
type definitions for constraints and constraint handlers