Modifier and Type | Method and Description |
---|---|
static IntStrategy |
Search.intVarSearch(VariableSelector<IntVar> varSelector,
IntValueSelector valSelector,
DecisionOperator<IntVar> decisionOperator,
IntVar... vars)
Builds your own search strategy based on binary decisions.
|
static IntStrategy |
Search.intVarSearch(VariableSelector<IntVar> varSelector,
IntValueSelector valSelector,
IntVar... vars)
Builds your own assignment strategy based on binary decisions.
|
Modifier and Type | Class and Description |
---|---|
class |
IntDomainMax
Selects the variable upper bound
|
class |
IntDomainMedian
Selects the median value in the variable domain.
|
class |
IntDomainMiddle
Selects the value in the variable domain closest to the mean of its current bounds.
|
class |
IntDomainMin
Selects the variable lower bound
|
class |
IntDomainRandom
Selects randomly a value in the variable domain.
|
class |
IntDomainRandomBound
Selects randomly between the lower and the upper bound of the variable
|
Constructor and Description |
---|
DomOverWDeg(IntVar[] variables,
long seed,
IntValueSelector valueSelector)
Creates a DomOverWDeg variable selector
|
Modifier and Type | Field and Description |
---|---|
protected IntValueSelector |
IntStrategy.valueSelector
How a value is selected
|
Modifier and Type | Method and Description |
---|---|
IntValueSelector |
IntStrategy.getValSelector() |
Constructor and Description |
---|
IntStrategy(IntVar[] scope,
VariableSelector<IntVar> varSelector,
IntValueSelector valSelector)
Creates a search strategy which selects a variable X and a value V to perform
the decision X = V
BEWARE: if the variable domain is not enumerated, the value V should be a domain bound.
|
IntStrategy(IntVar[] scope,
VariableSelector<IntVar> varSelector,
IntValueSelector valSelector,
DecisionOperator<IntVar> decOperator)
Creates a search strategy which selects a variable X and a value V to perform
the decision X decOperator V
This can be X <= V for instance.
|
Copyright © 2017. All rights reserved.