cons_lop.h
Go to the documentation of this file.
30 * tournament, i.e., it is an acyclic orientation of the complete graph. This encodes a linear order
31 * as follows. The rows and columns correspond to the elements of the set to be ordered. A variable
40 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
72 SCIP_Bool removable, /**< should the relaxation be removed from the LP due to aging or cleanup? */
73 SCIP_Bool stickingatnode /**< should the constraint always be kept at the node where it was added, even
Definition: struct_scip.h:68
Definition: struct_var.h:207
Definition: struct_cons.h:46
Definition: objbenders.h:43
SCIP callable library.
SCIP_RETCODE SCIPcreateConsLOP(SCIP *scip, SCIP_CONS **cons, const char *name, int n, SCIP_VAR ***vars, 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)
Definition: cons_lop.c:1205