Uses of Class
org.maxicp.cp.engine.core.AbstractCPConstraint
Packages that use AbstractCPConstraint
Package
Description
Constraints implementation (propagators)
Constraints implementation for Scheduling over Interval Variables and Cumulative Functions
Constraints implementation for Sequence Variables
Constraints implementation for Set Variables
Solver objects
-
Uses of AbstractCPConstraint in org.maxicp.cp.engine.constraints
Subclasses of AbstractCPConstraint in org.maxicp.cp.engine.constraintsModifier and TypeClassDescriptionclassAbsolute value constraintclassArc Consistent AllDifferent Constraint Algorithm described in "A filtering algorithm for constraints of difference in CSPs" J-C.classclassAmong constraintclassDomain Consistency Filtering for AtLeastNValue constraint.classclassA Binary Knapsack constraint ensures that the total load is equal to the sum of the weights of the selected items.classTheBinPackingconstraint ensures that a set of items with given weights are packed into bins such that each bin's total weight respects a given capacity constraint.classclassclassHamiltonian Circuit Constraint with a successor modelclassArc Consistent AllDifferent Constraint with CostsclassImplementation of the Global Cardinality Constraint with Costs from the paperclassElement Constraint modelingarray[y] = zclassElement1DDC constraintclassclassElement Constraint modelingmatrix[x][y] = zclassclassInversePerm is a constraint that enforces that one permutation is the inverse of another.classReified equality constraintclassReified equality constraintclassReified less or equal constraint.classReified is less or equal constraintb <=> x <= y.classReified logical or constraintclassLess or equal constraint between two variablesclassclassMaximum ConstraintclassConstraint x * b = y where b is a boolean variableclassMultiplication Constraint x * c = z where c is a constantclassMultiplication Constraint x * y = cclassMultiplication Constraint x * y = z (all variables)classImplementation of Compact Table for Negative Table algorithm described inclassNot Equal constraint between two variablesclassLogical or constraintx1 or x2 or ... xnclassImplementation of Compact Table for Short Table algorithm described inclassSoft Global Cardinality ConstraintclassSorted constraint, x is sorted in y according to permutation oclassSquare Constraint x * x = yclassEnsures that only one Hamiltonian circuit appears in the provided successor variables.classSum ConstraintclassImplementation of Compact Table algorithm described in -
Uses of AbstractCPConstraint in org.maxicp.cp.engine.constraints.scheduling
Subclasses of AbstractCPConstraint in org.maxicp.cp.engine.constraints.schedulingModifier and TypeClassDescriptionclassAlternative Constraint with cardinality: Enforces that if the interval a is present, then c intervals from the array alt must be present and synchronized with a.classCumulative constraint with sum decomposition (very slow).classclassEnforces that interval A ends at interval B end if B is present and that interval B ends at interval A end if A is presentclassEnforces that interval A ends at interval B start if B is present and that interval B starts at interval A end if A is presentclassclassConstrains interval A to end before or at the end of interval B.classConstrains interval A to end before or at the start of interval B if both are present.classChecker for the generalized cumulative constraint.classGeneralized Cumulative Constraint using Timetabling TODO Refer paper once publishedclassGeneralized Cumulative Constraint using Timetabling TODO Refer paper once publishedclassclassclassTODOclassTODOclassTODOclassTODOclassTODOclassTODOclassclassclassReified is end before start constraintclassReified is end before start constraintclassclassReified is end before start constraintclassReified is start before start constraintclassNoOverlap constraint, ensures that a set of interval variables do not overlap in time.classBound Consistency filtering for the NoOverlap constraintclassclassclassclassEnforces that interval A starts at interval B end if B is present and that interval B ends at interval A start if A is presentclassEnforces that interval A starts at interval B start if B is present and that interval B starts at interval A start if A is presentclassclassConstrains interval A to start before or at the end of interval B if both are present.classConstrains interval A to start before or at the start of interval B. -
Uses of AbstractCPConstraint in org.maxicp.cp.engine.constraints.seqvar
Subclasses of AbstractCPConstraint in org.maxicp.cp.engine.constraints.seqvarModifier and TypeClassDescriptionclassclassclassclassExcludes a node from a sequenceclassInserts a node into a sequenceclassclassclassImposes that the sequence defined by the provided orderedSequence where the relaxed nodes have been removed is a subsequence of the provided sequence variable.classRequires a node in a sequence, forcing the node to be visitedclassLinks twoCPSeqVar, ensuring a subsequence appears within a super sequenceclassLinks aCPSeqVarwith time windows, enforcing that visits happen during valid timeframes. -
Uses of AbstractCPConstraint in org.maxicp.cp.engine.constraints.setvar
Subclasses of AbstractCPConstraint in org.maxicp.cp.engine.constraints.setvarModifier and TypeClassDescriptionclassConstraint that enforces a boolean variable to be true if a value is included in a set.classConstraint that enforces a boolean variable is true if one set is a subset of another set.classConstraint that enforces that the first set variable is not a subset of the second set variable.classConstraint that links the cardinality of a set variable to an integer variable.classConstraint that enforces that one set variable is a subset of another set variable. -
Uses of AbstractCPConstraint in org.maxicp.cp.engine.core
Subclasses of AbstractCPConstraint in org.maxicp.cp.engine.core