| Class | Description |
|---|---|
| Absolute |
Absolute value constraint
|
| AllDifferentAC |
Arc Consistent AllDifferent Constraint
Algorithm described in
"A filtering algorithm for constraints of difference in CSPs" J-C.
|
| AllDifferentBinary | |
| Circuit |
Hamiltonian Circuit Constraint with a successor model
|
| Cumulative |
Cumulative constraint with time-table filtering
|
| CumulativeDecomposition |
Cumulative constraint with sum decomposition (very slow).
|
| Disjunctive |
Disjunctive Scheduling Constraint:
Any two pairs of activities cannot overlap in time.
|
| Element1D |
Element Constraint modeling
array[y] = z |
| Element1DVar | |
| Element2D |
Element Constraint modeling
matrix[x][y] = z |
| IsEqual |
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
|
| Maximum |
Maximum Constraint
|
| MaximumMatching |
Compute and Maintain a Maximum Matching
in the variable-value graph
|
| NegTableCT |
Negative table constraint
|
| 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
Rectangle
built from a set of Rectangle using a sweep-line algorithm. |
| ShortTableCT |
Table constraint with short tuples (having
* entries) |
| ShortTableDecomp |
Decomposition of table constraint with short tuples (having
* entries) |
| Sum |
Sum Constraint
|
| TableCT |
Implementation of Compact Table algorithm described in
Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets
Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus
See The article.
|
| TableDecomp | |
| ThetaTree |
Data Structure described in
Global Constraints in Scheduling, 2008 Petr Vilim, PhD thesis
See The thesis.
|
Copyright © 2018 Laurent Michel, Pierre Schaus, Pascal Van Hentenryck. All rights reserved.