Package | Description |
---|---|
minicp.cp |
Factory methods for modeling and create search heuristics
|
minicp.engine.constraints |
Constraints
|
minicp.engine.core |
Solver objects
|
Modifier and Type | Method and Description |
---|---|
static Constraint |
Factory.allDifferent(IntVar[] x)
Returns a binary decomposition of the allDifferent constraint.
|
static Constraint |
Factory.allDifferentAC(IntVar[] x)
Returns an allDifferent constraint that enforces
global arc consistency.
|
static Constraint |
Factory.largerOrEqual(IntVar x,
IntVar y)
Returns a constraint imposing that the
a first variable is larger or equal to a second one.
|
static Constraint |
Factory.lessOrEqual(IntVar x,
IntVar y)
Returns a constraint imposing that the
a first variable is less or equal to a second one.
|
static Constraint |
Factory.notEqual(IntVar x,
IntVar y)
Returns a constraint imposing that the two different variables
must take different values.
|
static Constraint |
Factory.notEqual(IntVar x,
IntVar y,
int c)
Returns a constraint imposing that the
the first variable differs from the second
one minus a constant value.
|
static Constraint |
Factory.sum(IntVar[] x,
int y)
Returns a sum constraint.
|
static Constraint |
Factory.sum(IntVar[] x,
IntVar y)
Returns a sum constraint.
|
Modifier and Type | Class and Description |
---|---|
class |
Absolute
Absolute value constraint
|
class |
AllDifferentAC
Arc Consistent AllDifferent Constraint
Algorithm described in
"A filtering algorithm for constraints of difference in CSPs" J-C.
|
class |
AllDifferentBinary |
class |
Circuit
Hamiltonian Circuit Constraint with a successor model
|
class |
Cumulative
Cumulative constraint with time-table filtering
|
class |
CumulativeDecomposition
Cumulative constraint with sum decomposition (very slow).
|
class |
Disjunctive
Disjunctive Scheduling Constraint:
Any two pairs of activities cannot overlap in time.
|
class |
Element1D
Element Constraint modeling
array[y] = z |
class |
Element1DVar |
class |
Element2D
Element Constraint modeling
matrix[x][y] = z |
class |
IsEqual
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 |
Maximum
Maximum Constraint
|
class |
NegTableCT
Negative table constraint
|
class |
NotEqual
Not Equal constraint between two variables
|
class |
Or
Logical or constraint
x1 or x2 or ... xn |
class |
ShortTableCT
Table constraint with short tuples (having
* entries) |
class |
ShortTableDecomp
Decomposition of table constraint with short tuples (having
* entries) |
class |
Sum
Sum Constraint
|
class |
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.
|
class |
TableDecomp |
Modifier and Type | Class and Description |
---|---|
class |
AbstractConstraint
Abstract class the most of the constraints
should extend.
|
class |
ConstraintClosure |
Modifier and Type | Method and Description |
---|---|
void |
MiniCP.post(Constraint c) |
void |
Solver.post(Constraint c)
Posts the constraint, that is call
post() and
computes the fix-point. |
void |
MiniCP.post(Constraint c,
boolean enforceFixPoint) |
void |
Solver.post(Constraint c,
boolean enforceFixPoint)
Posts the constraint that is call
post()
and optionally computes the fix-point. |
void |
IntVarViewMul.propagateOnBind(Constraint c) |
void |
IntVarImpl.propagateOnBind(Constraint c) |
void |
IntVar.propagateOnBind(Constraint c)
Asks that
propagate() is called whenever the domain
of this variable is reduced to a singleton. |
void |
IntVarViewOffset.propagateOnBind(Constraint c) |
void |
IntVarViewOpposite.propagateOnBind(Constraint c) |
void |
IntVarViewMul.propagateOnBoundChange(Constraint c) |
void |
IntVarImpl.propagateOnBoundChange(Constraint c) |
void |
IntVar.propagateOnBoundChange(Constraint c)
Asks that
propagate() is called whenever the
bound (maximum or minimum values) of the domain
of this variable is changes. |
void |
IntVarViewOffset.propagateOnBoundChange(Constraint c) |
void |
IntVarViewOpposite.propagateOnBoundChange(Constraint c) |
void |
IntVarViewMul.propagateOnDomainChange(Constraint c) |
void |
IntVarImpl.propagateOnDomainChange(Constraint c) |
void |
IntVar.propagateOnDomainChange(Constraint c)
Asks that
propagate() is called whenever the domain
of this variable changes. |
void |
IntVarViewOffset.propagateOnDomainChange(Constraint c) |
void |
IntVarViewOpposite.propagateOnDomainChange(Constraint c) |
void |
MiniCP.schedule(Constraint c) |
void |
Solver.schedule(Constraint c)
Schedules the constraint to be propagated by the fix-point.
|
Modifier and Type | Method and Description |
---|---|
protected void |
IntVarImpl.scheduleAll(StateStack<Constraint> constraints) |
Copyright © 2018 Laurent Michel, Pierre Schaus, Pascal Van Hentenryck. All rights reserved.