Uses of Class
org.maxicp.cp.engine.core.AbstractCPConstraint

Packages that use AbstractCPConstraint

Package	Description
org.maxicp.cp.engine.constraints	Constraints implementation (propagators)
org.maxicp.cp.engine.constraints.scheduling	Constraints implementation for Scheduling over Interval Variables and Cumulative Functions
org.maxicp.cp.engine.constraints.seqvar	Constraints implementation for Sequence Variables
org.maxicp.cp.engine.constraints.setvar	Constraints implementation for Set Variables
org.maxicp.cp.engine.core	Solver objects

Uses of AbstractCPConstraint in org.maxicp.cp.engine.constraints

Subclasses of AbstractCPConstraint in org.maxicp.cp.engine.constraints

Modifier and Type	Class	Description
class	Absolute	Absolute value constraint
class	AllDifferentDC	Arc Consistent AllDifferent Constraint
class	AllDifferentFWC	Forward Checking AllDifferent Constraint.
class	Among	Among constraint.
class	AtLeastNValueDC	Domain Consistency Filtering for AtLeastNValue constraint.
class	AtLeastNValueFWC	Forward Checking filtering for the AtLeastNValue constraint.
class	BinaryKnapsack	A Binary Knapsack constraint ensures that the total load is equal to the sum of the weights of the selected items.
class	BinPacking	The BinPacking constraint 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.
class	CardinalityMaxFWC	Forward Checking Cardinality (Upper Bound) Constraint.
class	CardinalityMinFWC	Forward Checking Cardinality (Lower Bound) Constraint.
class	Circuit	Hamiltonian Circuit Constraint with a successor model
class	CostAllDifferentDC	Arc Consistent AllDifferent Constraint with Costs
class	CostCardinalityMaxDC	Implementation of the Global Cardinality Constraint with Costs from the paper
class	DivVar	Integer Constraint x / y = z (all variables)
class	Element1D	Element Constraint modeling array[y] = z
class	Element1DDC	Element1DDC constraint
class	Element1DVar	Element Constraint over an array of variables, modeling array[y] = z.
class	Element2D	Element Constraint modeling matrix[x][y] = z
class	Equal	Equality constraint between two integer variables x = y.
class	InversePerm	InversePerm is a constraint that enforces that one permutation is the inverse of another.
class	IsEqual	Reified equality constraint
class	IsEqualVar	Reified equality constraint
class	IsLessOrEqual	Reified less or equal constraint.
class	IsLessOrEqualVar	Reified is less or equal constraint b <=> x <= y.
class	IsOr	Reified logical or constraint
class	LessOrEqual	Less or equal constraint between two variables
class	LexLe	Global lexicographic ordering constraint between two vectors x and y: enforces x <=_lex y (when strict == false) or x <_lex y (when strict == true).
class	LightBinaryKnapsack	Lightweight Binary Knapsack constraint enforcing load = sum_i items[i] * weights[i] using bound reasoning on the required and possible loads.
class	Maximum	Maximum Constraint
class	Mul	Constraint x * b = y where b is a boolean variable
class	MulCte	Multiplication Constraint x * c = z where c is a constant
class	MulCteRes	Multiplication Constraint x * y = c
class	MulVar	Multiplication Constraint x * y = z (all variables)
class	NegTableCT	Implementation of Compact Table for Negative Table algorithm described in
class	NotEqual	Not Equal constraint between two variables
class	Or	Logical or constraint x1 or x2 or ... xn
class	ShortTableCT	Implementation of Compact Table for Short Table algorithm described in
class	SoftCardinalityDC	Soft Global Cardinality Constraint.
class	Sorted	Sorted constraint, x is sorted in y according to permutation o
class	Square	Square Constraint x * x = y
class	SubCircuit	Ensures that only one Hamiltonian circuit appears in the provided successor variables.
class	Sum	Sum Constraint
class	TableCT	Implementation 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.scheduling

Modifier and Type	Class	Description
class	Alternative	Alternative 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.
class	CumulativeDecomposition	Cumulative constraint with sum decomposition (very slow).
class	EndAfter	Constraint enforcing that the end of an interval variable comes after or at a given integer variable: end(interval) >= var when interval is present.
class	EndAtEnd	Enforces that interval A ends at interval B end if B is present and that interval B ends at interval A end if A is present
class	EndAtStart	Enforces that interval A ends at interval B start if B is present and that interval B starts at interval A end if A is present
class	EndBefore	Constraint enforcing that the end of an interval variable comes before or at a given integer variable: end(interval) <= var when interval is present.
class	EndBeforeEnd	Constrains interval A to end before or at the end of interval B.
class	EndBeforeStart	Constrains interval A to end before or at the start of interval B if both are present.
class	GeneralizedCumulativeChecker	Checker for the generalized cumulative constraint.
class	GeneralizedCumulativeConstraint	Generalized Cumulative Constraint using Timetabling TODO Refer paper once published
class	GeneralizedCumulativeConstraintBaseLine	Generalized Cumulative Constraint using Timetabling TODO Refer paper once published
class	GeneralizedCumulativeSweepMax	Sweep-line filtering algorithm for the Generalized Cumulative constraint enforcing a maximum capacity bound.
class	GeneralizedCumulativeSweepMin	Sweep-line filtering algorithm for the Generalized Cumulative constraint enforcing a minimum capacity bound.
class	IntervalVarEnd	Constraint linking the end time of an interval variable var to an integer variable end.
class	IntervalVarEndOrValue	Constraint linking the end time of an interval variable var to an integer variable end when var is present, or fixing end to a default value when var is absent.
class	IntervalVarLength	Constraint linking the length (duration) of an interval variable var to an integer variable length.
class	IntervalVarLengthOrValue	Constraint linking the length (duration) of an interval variable var to an integer variable length when var is present, or fixing length to a default value when var is absent.
class	IntervalVarStart	Constraint linking the start time of an interval variable var to an integer variable start.
class	IntervalVarStartOrValue	Constraint linking the start time of an interval variable var to an integer variable start when var is present, or fixing start to a default value when var is absent.
class	IsEndAfter	Reified constraint enforcing boolVar <=> end(intervalVar) >= var when intervalVar is present.
class	IsEndBefore	Reified constraint enforcing boolVar <=> end(intervalVar) <= var when intervalVar is present.
class	IsEndBeforeEnd	Reified is end before start constraint
class	IsEndBeforeStart	Reified is end before start constraint
class	IsEndBeforeStartWithTransition	Reified temporal ordering constraint with transition times.
class	IsStartBefore	Reified constraint enforcing boolVar <=> start(intervalVar) <= var when intervalVar is present.
class	IsStartBeforeEnd	Reified is end before start constraint
class	IsStartBeforeStart	Reified is start before start constraint
class	NoOverlap	NoOverlap constraint, ensures that a set of interval variables do not overlap in time.
class	NoOverlapBC	Bound Consistency filtering for the NoOverlap constraint
class	NoOverlapBinary	Binary NoOverlap constraint enforcing that two interval variables A and B do not overlap in time when both are present.
class	NoOverlapBinaryWithTransitionTime	Binary NoOverlap constraint with transition times enforcing that two interval variables A and B do not overlap and respect minimum setup/transition times transitionTimeAB (when A precedes B) and transitionTimeBA (when B precedes A) when both are present.
class	NoOverlapWithPosition	A global constraint that enforces a permutation (ordering) of interval variables with minimum transition times, using set-variable-based propagation for stronger filtering than the binary decomposition NoOverlapWithPositionDecomposition.
class	NoOverlapWithPositionDecomposition	A constraint that enforces a permutation (ordering) of interval variables, typically used for routing/scheduling problems such as TSP or job sequencing.
class	Span	Span Constraint: Enforces that if the interval span is present, then it begins with the first interval intervals from the array alt and ends with the latest.
class	StartAfter	Constraint enforcing that the start of an interval variable comes after or at a given integer variable: start(interval) >= var when interval is present.
class	StartAtEnd	Enforces that interval A starts at interval B end if B is present and that interval B ends at interval A start if A is present
class	StartAtStart	Enforces that interval A starts at interval B start if B is present and that interval B starts at interval A start if A is present
class	StartBefore	Constraint enforcing that the start of an interval variable comes before or at a given integer variable: start(interval) <= var when interval is present.
class	StartBeforeEnd	Constrains interval A to start before or at the end of interval B if both are present.
class	StartBeforeStart	Constrains 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.seqvar

Modifier and Type	Class	Description
class	Cumulative	Cumulative constraint on a sequence variable (CPSeqVar), ensuring that the total resource consumption of active activities along the sequence never exceeds a given capacity.
class	Distance	Distance constraint on a sequence variable (CPSeqVar), maintaining the total travel distance between consecutive visited nodes in the sequence.
class	Exclude	Excludes a node from a sequence
class	Insert	Inserts a node into a sequence
class	NoOverlapSequence	Channels a CPSeqVar with an array of CPIntervalVar and enforces a no-overlap with minimum transition times between consecutive intervals.
class	NotBetween	Constraint forbidding a node from being inserted immediately between a given predecessor and successor in a sequence variable (CPSeqVar).
class	Precedence	Precedence constraint on a sequence variable (CPSeqVar), ensuring that a given list of nodes appears in the specified relative order within the sequence.
class	RelaxedSequence	Imposes that the sequence defined by the provided orderedSequence where the relaxed nodes have been removed is a subsequence of the provided sequence variable.
class	Require	Requires a node in a sequence, forcing the node to be visited
class	SubSequence	Links two CPSeqVar, ensuring a subsequence appears within a super sequence
class	TransitionTimes	Links a CPSeqVar with 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.setvar

Modifier and Type	Class	Description
class	IsIncluded	Constraint that enforces a boolean variable to be true if a value is included in a set.
class	IsSubset	Constraint that enforces a boolean variable is true if one set is a subset of another set.
class	NotSubset	Constraint that enforces that the first set variable is not a subset of the second set variable.
class	SetCard	Constraint that links the cardinality of a set variable to an integer variable.
class	Subset	Constraint 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

Modifier and Type	Class	Description
class	CPConstraintClosure
class	CPConstraintClosureWithDelta