All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
pub_cons.h
Go to the documentation of this file.
22 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
86 SCIP_DECL_CONSSEPASOL ((*conssepasol)), /**< separate cutting planes for arbitrary primal solution */
87 int sepafreq, /**< frequency for separating cuts; zero means to separate only in the root node */
92 /** sets both the propagation callback and the propagation frequency of the constraint handler */
97 int propfreq, /**< frequency for propagating domains; zero means only preprocessing propagation */
98 SCIP_Bool delayprop, /**< should propagation method be delayed, if other propagators found reductions? */
99 SCIP_PROPTIMING timingmask /**< positions in the node solving loop where propagators should be executed */
102 /** gets array with constraints of constraint handler; the first SCIPconshdlrGetNActiveConss() entries are the active
103 * constraints, the last SCIPconshdlrGetNConss() - SCIPconshdlrGetNActiveConss() constraints are deactivated
105 * @note A constraint is active if it is global and was not removed or it was added locally (in that case the local
145 * @note A constraint is active if it is global and was not removed or it was added locally (in that case the local
195 /** gets time in seconds used for propagation in this constraint handler during strong branching */
285 /** gets maximum number of active constraints of constraint handler existing at the same time */
321 /** gets number of holes added to domains of variables in presolving method of constraint handler */
357 /** gets number of times the presolving method of the constraint handler was called and tried to find reductions */
393 /** gets frequency of constraint handler for eager evaluations in separation, propagation and enforcement */
510 /** for an active constraint, returns the depth in the tree at which the constraint was activated */
516 /** returns the depth in the tree at which the constraint is valid; returns INT_MAX, if the constraint is local
626 /** returns TRUE iff constraint's relaxation should be removed from the LP due to aging or cleanup */
632 /** returns TRUE iff constraint's relaxation should be removed from the LP due to aging or cleanup */
668 /** returns TRUE iff roundings for variables in constraint or in constraint's negation are locked */
699 /** gets number of locks against upgrading the constraint, 0 means this constraint can be upgraded */
707 /* In optimized mode, the function calls are overwritten by defines to reduce the number of function calls and
721 #define SCIPconsIsActive(cons) ((cons)->updateactivate || ((cons)->active && !(cons)->updatedeactivate))
722 #define SCIPconsIsEnabled(cons) ((cons)->updateenable || ((cons)->enabled && !(cons)->updatedisable))
724 (SCIPconsIsEnabled(cons) && ((cons)->updatesepaenable || ((cons)->sepaenabled && !(cons)->updatesepadisable)))
|