| Package | Description |
|---|---|
| minicp.cp |
Factory methods for modeling and create search heuristics
|
| minicp.engine.constraints |
Constraints
|
| minicp.engine.core |
Solver objects
|
| minicp.examples |
Model examples
|
| Modifier and Type | Method and Description |
|---|---|
static IntVar |
Factory.abs(IntVar x)
Computes a variable that is the absolute value of the given variable.
|
static IntVar |
Factory.element(int[][] matrix,
IntVar x,
IntVar y)
Returns a variable representing
the value in a matrix at the position
specified by the two given row and column index variables
This relation is enforced by the
Element2D constraint
posted by calling this method. |
static IntVar |
Factory.element(int[] array,
IntVar y)
Returns a variable representing
the value in an array at the position
specified by the given index variable
This relation is enforced by the
Element1D constraint
posted by calling this method. |
static IntVar |
Factory.makeIntVar(Solver cp,
int sz)
Creates a variable with a domain of specified arity.
|
static IntVar |
Factory.makeIntVar(Solver cp,
int min,
int max)
Creates a variable with a domain equal to the specified range.
|
static IntVar |
Factory.makeIntVar(Solver cp,
Set<Integer> values)
Creates a variable with a domain equal to the specified set of values.
|
static IntVar[] |
Factory.makeIntVarArray(int n,
Function<Integer,IntVar> body)
Creates an array of variables with specified lambda function
|
static IntVar[] |
Factory.makeIntVarArray(Solver cp,
int n,
int sz)
Creates an array of variables with specified domain size.
|
static IntVar[] |
Factory.makeIntVarArray(Solver cp,
int n,
int min,
int max)
Creates an array of variables with specified domain bounds.
|
static IntVar |
Factory.maximum(IntVar... x)
Computes a variable that is the maximum of a set of variables.
|
static IntVar |
Factory.minimum(IntVar... x)
Computes a variable that is the minimum of a set of variables.
|
static IntVar |
Factory.minus(IntVar x)
A variable that is a view of
-x. |
static IntVar |
Factory.minus(IntVar x,
int v)
A variable that is a view of
x-v. |
static IntVar |
Factory.mul(IntVar x,
int a)
A variable that is a view of
x*a. |
static IntVar |
Factory.plus(IntVar x,
int v)
A variable that is a view of
x+v. |
static IntVar |
Factory.sum(IntVar... x)
Returns a variable representing
the sum of a given set of variables.
|
| Modifier and Type | Method and Description |
|---|---|
static IntVar |
Factory.abs(IntVar x)
Computes a variable that is the absolute value of the given variable.
|
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 IntVar |
Factory.element(int[][] matrix,
IntVar x,
IntVar y)
Returns a variable representing
the value in a matrix at the position
specified by the two given row and column index variables
This relation is enforced by the
Element2D constraint
posted by calling this method. |
static IntVar |
Factory.element(int[] array,
IntVar y)
Returns a variable representing
the value in an array at the position
specified by the given index variable
This relation is enforced by the
Element1D constraint
posted by calling this method. |
static void |
Factory.equal(IntVar x,
int v)
Forces the variable to be equal to some given value and
computes the fix point.
|
static Supplier<Procedure[]> |
BranchingScheme.firstFail(IntVar... x)
First-Fail strategy.
|
static BoolVar |
Factory.isEqual(IntVar x,
int c)
Returns a boolean variable representing
whether one variable is equal to the given constant.
|
static BoolVar |
Factory.isLarger(IntVar x,
int c)
Returns a boolean variable representing
whether one variable is larger than the given constant.
|
static BoolVar |
Factory.isLargerOrEqual(IntVar x,
int c)
Returns a boolean variable representing
whether one variable is larger or equal to the given constant.
|
static BoolVar |
Factory.isLess(IntVar x,
int c)
Returns a boolean variable representing
whether one variable is less than the given constant.
|
static BoolVar |
Factory.isLessOrEqual(IntVar x,
int c)
Returns a boolean variable representing
whether one variable is less or equal to the given constant.
|
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 void |
Factory.lessOrEqual(IntVar x,
int v)
Forces the variable to be less or equal to some given value and
computes the fix point.
|
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 IntVar |
Factory.maximum(IntVar... x)
Computes a variable that is the maximum of a set of variables.
|
static IntVar |
Factory.minimum(IntVar... x)
Computes a variable that is the minimum of a set of variables.
|
static IntVar |
Factory.minus(IntVar x)
A variable that is a view of
-x. |
static IntVar |
Factory.minus(IntVar x,
int v)
A variable that is a view of
x-v. |
static IntVar |
Factory.mul(IntVar x,
int a)
A variable that is a view of
x*a. |
static void |
Factory.notEqual(IntVar x,
int v)
Forces the variable to be different to some given value and
computes the fix point.
|
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 IntVar |
Factory.plus(IntVar x,
int v)
A variable that is a view of
x+v. |
static IntVar |
Factory.sum(IntVar... x)
Returns a variable representing
the sum of a given set of variables.
|
static Constraint |
Factory.sum(IntVar[] x,
int y)
Returns a sum constraint.
|
static Constraint |
Factory.sum(IntVar[] x,
IntVar y)
Returns a sum constraint.
|
static Constraint |
Factory.sum(IntVar[] x,
IntVar y)
Returns a sum constraint.
|
| Modifier and Type | Method and Description |
|---|---|
static IntVar[] |
Factory.makeIntVarArray(int n,
Function<Integer,IntVar> body)
Creates an array of variables with specified lambda function
|
| Constructor and Description |
|---|
Absolute(IntVar x,
IntVar y)
Creates the absolute value constraint
y = |x|. |
AllDifferentAC(IntVar... x) |
AllDifferentBinary(IntVar... x) |
Circuit(IntVar[] x)
Creates an Hamiltonian Circuit Constraint
with a successor model.
|
Cumulative(IntVar[] start,
int[] duration,
int[] demand,
int capa)
Creates a cumulative constraint with a time-table filtering.
|
CumulativeDecomposition(IntVar[] start,
int[] duration,
int[] demand,
int capa)
Creates a cumulative constraint with a decomposition into sum constraint.
|
Disjunctive(IntVar[] start,
int[] duration)
Creates a disjunctive constraint that enforces
that for any two pair i,j of activities we have
start[i]+duration[i] <= start[j] or start[j]+duration[j] <= start[i]. |
Element1D(int[] array,
IntVar y,
IntVar z)
Creates an element constraint
array[y] = z |
Element1DVar(IntVar[] array,
IntVar y,
IntVar z) |
Element1DVar(IntVar[] array,
IntVar y,
IntVar z) |
Element2D(int[][] mat,
IntVar x,
IntVar y,
IntVar z)
Creates an element constraint
mat[x][y] = z |
IsEqual(BoolVar b,
IntVar x,
int c)
Returns a boolean variable representing
whether one variable is equal to the given constant.
|
IsLessOrEqual(BoolVar b,
IntVar x,
int c)
Creates a constraint that
link a boolean variable representing
whether one variable is less or equal to the given constant.
|
IsLessOrEqualVar(BoolVar b,
IntVar x,
IntVar y)
Creates a reified is less or equal constraint
b <=> x <= y. |
LessOrEqual(IntVar x,
IntVar y) |
Maximum(IntVar[] x,
IntVar y)
Creates the maximum constraint y = maximum(x[0],x[1],...
|
Maximum(IntVar[] x,
IntVar y)
Creates the maximum constraint y = maximum(x[0],x[1],...
|
MaximumMatching(IntVar... x) |
NegTableCT(IntVar[] x,
int[][] table)
Negative Table constraint.
|
NotEqual(IntVar x,
IntVar y)
Creates a constraint such
that {@code x !
|
NotEqual(IntVar x,
IntVar y,
int c)
Creates a constraint such
that {@code x !
|
ShortTableCT(IntVar[] x,
int[][] table,
int star)
Create a Table constraint with short tuples.
|
ShortTableDecomp(IntVar[] x,
int[][] table,
int star)
Table constraint.
|
Sum(IntVar[] x)
Creates a sum constraint.
|
Sum(IntVar[] x,
int y)
Creates a sum constraint.
|
Sum(IntVar[] x,
IntVar y)
Creates a sum constraint.
|
Sum(IntVar[] x,
IntVar y)
Creates a sum constraint.
|
TableCT(IntVar[] x,
int[][] table)
Table constraint.
|
TableDecomp(IntVar[] x,
int[][] table)
Decomposition of a table constraint.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
BoolVar
Boolean variable, that can be used as a 0-1 IntVar.
|
| Modifier and Type | Class and Description |
|---|---|
class |
BoolVarImpl |
class |
BoolVarIsEqual |
class |
IntVarImpl
Implementation of a variable
with a
SparseSetDomain. |
class |
IntVarViewMul
A view on a variable of type
a*x |
class |
IntVarViewOffset
A view on a variable of type
x+o |
class |
IntVarViewOpposite
A view on a variable of type
-x |
| Modifier and Type | Method and Description |
|---|---|
Objective |
MiniCP.maximize(IntVar x) |
Objective |
Solver.maximize(IntVar x)
Creates a maximization objective on the given variable.
|
Objective |
MiniCP.minimize(IntVar x) |
Objective |
Solver.minimize(IntVar x)
Creates a minimization objective on the given variable.
|
| Constructor and Description |
|---|
BoolVarIsEqual(IntVar x,
int v) |
IntVarViewMul(IntVar x,
int a) |
IntVarViewOffset(IntVar x,
int offset) |
IntVarViewOpposite(IntVar x) |
Minimize(IntVar x) |
| Modifier and Type | Method and Description |
|---|---|
static IntVar[] |
JobShop.flatten(IntVar[][] x) |
static IntVar[] |
Eternity.flatten(IntVar[][] x) |
| Modifier and Type | Method and Description |
|---|---|
static IntVar[] |
JobShop.flatten(IntVar[][] x) |
static IntVar[] |
Eternity.flatten(IntVar[][] x) |
Copyright © 2018 Laurent Michel, Pierre Schaus, Pascal Van Hentenryck. All rights reserved.