Module org.maxicp

Package org.maxicp.cp.engine.constraints

package org.maxicp.cp.engine.constraints

Constraints implementation (propagators)

Related Packages

Package	Description
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

Class	Description
Absolute	Absolute value constraint
AllDifferentDC	Arc Consistent AllDifferent Constraint
AllDifferentFWC	Forward Checking AllDifferent Constraint.
Among	Among constraint.
AtLeastNValueDC	Domain Consistency Filtering for AtLeastNValue constraint.
AtLeastNValueFWC	Forward Checking filtering for the AtLeastNValue constraint.
BinaryKnapsack	A Binary Knapsack constraint ensures that the total load is equal to the sum of the weights of the selected items.
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.
CardinalityMaxFWC	Forward Checking Cardinality (Upper Bound) Constraint.
CardinalityMinFWC	Forward Checking Cardinality (Lower Bound) Constraint.
Circuit	Hamiltonian Circuit Constraint with a successor model
CostAllDifferentDC	Arc Consistent AllDifferent Constraint with Costs
CostCardinalityMaxDC	Implementation of the Global Cardinality Constraint with Costs from the paper
CostCardinalityMaxDC.Algorithm
DivVar	Integer Constraint x / y = z (all variables)
Element1D	Element Constraint modeling array[y] = z
Element1DDC	Element1DDC constraint
Element1DVar	Element Constraint over an array of variables, modeling array[y] = z.
Element2D	Element Constraint modeling matrix[x][y] = z
Equal	Equality constraint between two integer variables x = y.
InversePerm	InversePerm is a constraint that enforces that one permutation is the inverse of another.
IsEqual	Reified equality constraint
IsEqualVar	Reified equality constraint
IsLessOrEqual	Reified less or equal constraint.
IsLessOrEqualVar	Reified is less or equal constraint b <=> x <= y.
IsOr	Reified logical or constraint
LessOrEqual	Less or equal constraint between two variables
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).
LightBinaryKnapsack	Lightweight Binary Knapsack constraint enforcing load = sum_i items[i] * weights[i] using bound reasoning on the required and possible loads.
Maximum	Maximum Constraint
MaximumMatching	Compute and Maintain a Maximum Matching in the variable-value graph
MinCostMaxFlow	Minimum-cost maximum-flow algorithm using successive shortest augmenting paths with potentials.
Mul	Constraint x * b = y where b is a boolean variable
MulCte	Multiplication Constraint x * c = z where c is a constant
MulCteRes	Multiplication Constraint x * y = c
MulVar	Multiplication Constraint x * y = z (all variables)
NegTableCT	Implementation of Compact Table for Negative Table algorithm described in
NotEqual	Not Equal constraint between two variables
Or	Logical or constraint x1 or x2 or ... xn
Profile	Representation of a cumulated Profile data structure as a contiguous sequence of Profile.Rectangle built from a set of Profile.Rectangle using a sweep-line algorithm.
SCC	Tarjan's algorithm to find strongly connected components (SCCs) in a directed graph.
ShortTableCT	Implementation of Compact Table for Short Table algorithm described in
SoftCardinalityDC	Soft Global Cardinality Constraint.
Sorted	Sorted constraint, x is sorted in y according to permutation o
Square	Square Constraint x * x = y
SubCircuit	Ensures that only one Hamiltonian circuit appears in the provided successor variables.
Sum	Sum Constraint
TableCT	Implementation of Compact Table algorithm described in