All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
cons_linking.h
Go to the documentation of this file.
22 * The constraints handler stores linking constraints between an integer variable and an array of binary variables. Such
27 * with integer variable \f$ y \f$, binary variables \f$ x_1, \dots, x_n \f$ and offset \f$b \in Q\f$, and
28 * with the additional side condition that exactly one binary variable has to be one (set partitioning condition).
30 * This constraint can be created only with the integer variable. In this case the binary variables are only created on
31 * demand. That is, whenever someone asks for the binary variables. Therefore, such constraints can be used to get a
32 * "binary representation" of the domain of the integer variable which will be dynamically created.
35 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
55 * @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
86 SCIP_Bool stickingatnode /**< should the constraint always be kept at the node where it was added, even
92 * in its most basic version, i. e., all constraint flags are set to their basic value as explained for the
97 * @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
|