Constructor and Description |
---|
PropNogoods(Model model)
Create a (unique) propagator for no-goods recording and propagation.
|
PropSat(Model model)
Create a (unique) propagator for clauses recording and propagation.
|
Modifier and Type | Method and Description |
---|---|
Model |
Model._me() |
Model |
ParallelPortfolio.getBestModel()
Returns the first model from the list which, either :
finds a solution when dealing with a satisfaction problem,
or finds (and possibly proves) the best solution when dealing with an optimization problem.
|
Model |
Solver.getModel() |
Modifier and Type | Method and Description |
---|---|
List<Model> |
ParallelPortfolio.getModels() |
Modifier and Type | Method and Description |
---|---|
void |
ParallelPortfolio.addModel(Model model)
Adds a model to the list of models to run in parallel.
|
default AbstractStrategy |
Settings.makeDefaultSearch(Model model)
Creates a default search strategy for the input model
|
Constructor and Description |
---|
Solution(Model model,
Variable... varsToStore)
Create an empty solution object
able to store the value of each variable in
varsToStore when calling record()
Stores all variables by default, when varsToStore is empty |
Solver(Model aModel)
Create a resolver based for the model aModel.
|
Modifier and Type | Field and Description |
---|---|
protected Model |
Propagator.model
Reference to the model declaring this propagator.
|
Modifier and Type | Method and Description |
---|---|
Model |
Propagator.getModel() |
Modifier and Type | Method and Description |
---|---|
static ILogical |
LogicTreeToolBox.simplify(ILogical t,
Model model)
Detects tautologies and contradictions from
t |
static ILogical |
LogicTreeToolBox.simplifySingleton(ILogical l,
Model model)
Remove tautologies from
l |
static ILogical |
LogicTreeToolBox.toCNF(LogOp logOp,
Model model)
Warning: if there is a bug, please check the CNF build is like:
- lit OR lit ...
|
Constructor and Description |
---|
SatConstraint(Model model) |
Modifier and Type | Method and Description |
---|---|
static Constraint |
GlobalCardinality.reformulate(IntVar[] vars,
IntVar[] card,
Model model) |
Constructor and Description |
---|
NogoodConstraint(Model model) |
Constructor and Description |
---|
G(Model model,
int nbNodes)
Creates a backtrackable undirected graph of nbNodes nodes
|
Constructor and Description |
---|
R3(int nbDecVars,
Model model) |
Constructor and Description |
---|
ExplanationEngine(Model model,
boolean partialExplanationsOn,
boolean recordCauses)
Create an explanation engine based on a rule store
|
Modifier and Type | Method and Description |
---|---|
Model |
UnCArExpression.getModel() |
Model |
CArExpression.getModel()
Return the associated model
|
Model |
BiCArExpression.getModel() |
Modifier and Type | Method and Description |
---|---|
Model |
UnArExpression.getModel() |
Model |
NaArExpression.getModel() |
Model |
BiArExpression.getModel() |
Model |
ArExpression.getModel()
Return the associated model
|
Modifier and Type | Method and Description |
---|---|
Model |
UnLoExpression.getModel() |
Model |
NaLoExpression.getModel() |
abstract Model |
LoExpression.getModel()
Return the associated model
|
Model |
BiLoExpression.getModel() |
Modifier and Type | Method and Description |
---|---|
abstract Model |
ReExpression.getModel()
Return the associated model
|
Model |
NaReExpression.getModel() |
Model |
BiReExpression.getModel() |
Modifier and Type | Method and Description |
---|---|
abstract IPropagationEngine |
PropagationEngineFactory.make(Model model) |
Constructor and Description |
---|
PropagationTrigger(IPropagationEngine engine,
Model model) |
Constructor and Description |
---|
SevenQueuesPropagatorEngine(Model model)
A seven-queue propagation engine.
|
TwoBucketPropagationEngine(Model model)
Creates a two-bucket propagation engine.
|
Constructor and Description |
---|
BacktrackCounter(Model model,
long backtracklimit) |
FailCounter(Model model,
long faillimit) |
NodeCounter(Model model,
long nodelimit) |
SolutionCounter(Model model,
long solutionlimit) |
TimeCounter(Model model,
long timeLimitInNano) |
Modifier and Type | Method and Description |
---|---|
static String |
Reporting.fullReport(Model model) |
static String |
Reporting.onDecisions(Model model) |
static String |
Reporting.onUninstiatedVariables(Model model) |
static String |
Reporting.onUnsatisfiedConstraints(Model model) |
Modifier and Type | Field and Description |
---|---|
protected Model |
LearnExplained.mModel
The solver to explain.
|
Constructor and Description |
---|
LearnCBJ(Model mModel,
boolean nogoodFromConflict,
boolean userFeedbackOn)
Create a Conflict-based Backjumping strategy.
|
LearnDBT(Model mModel,
boolean nogoodFromConflict,
boolean userFeedbackOn)
Create a Dynamic Backtracking strategy.
|
LearnExplained(Model mModel,
boolean partialExplanationsOn,
boolean recordCauses)
Equips the solver with an explanation engine, which is able to explain failures and solutions.
|
Modifier and Type | Field and Description |
---|---|
protected Model |
RandomNeighborhood.mModel
Reference to the model
|
protected Model |
PropagationGuidedNeighborhood.mModel
Reference to the model
|
protected Model |
ExplainingCut.mModel
Reference to the model
|
Constructor and Description |
---|
ExplainingCut(Model aModel,
int level,
long seed)
Create a neighborhood which analyses the explanation of the cut wrt decision path to focus on decisions
more prone to not interact with the cut
|
Constructor and Description |
---|
CPProfiler(Model aModel,
boolean sendDomain)
Active connection to cp-profiler.
|
FailPerPropagator(Constraint[] constraints,
Model model)
Create an observer on propagators failures, based on the constraints in input
|
NogoodFromRestarts(Model model)
A constraint for the specific Nogood store designed to store ONLY positive decisions.
|
Constructor and Description |
---|
MoveBinaryHBFS(Model model,
AbstractStrategy strategy,
double a,
double b,
long N)
Create a move dedicated to run an Hybrid Best-First Search[1] (HBFS) with binary decisions.
|
MoveSeq(Model model,
Move... moves)
Create a move which sequentially apply a move.
|
Modifier and Type | Method and Description |
---|---|
static AbstractStrategy |
Search.defaultSearch(Model model)
Creates a default search strategy for the given model.
|
Constructor and Description |
---|
ActivityBased(Model model,
IntVar[] vars,
double g,
double d,
int a,
int samplingIterationForced,
long seed) |
AntiFirstFail(Model model)
First fail variable selector.
|
FirstFail(Model model)
First fail variable selector.
|
InputOrder(Model model)
Input order variable selector.
|
Modifier and Type | Field and Description |
---|---|
protected Model |
LastConflict.model
The target solver
|
protected Model |
ConflictOrderingSearch.model
The target solver
|
Constructor and Description |
---|
ConflictOrderingSearch(Model model,
AbstractStrategy<V> mainStrategy)
Creates a conflict-ordering search
|
LastConflict(Model model,
AbstractStrategy<Variable> mainStrategy,
int k)
Creates a last conflict heuristic
|
Modifier and Type | Method and Description |
---|---|
Model |
Variable.getModel()
Return the associated model
|
Modifier and Type | Field and Description |
---|---|
protected Model |
AbstractVariable.model
Reference to the model containing this variable (unique).
|
Modifier and Type | Method and Description |
---|---|
Model |
AbstractVariable.getModel() |
Constructor and Description |
---|
AbstractVariable(String name,
Model model)
Create the shared data of any type of variable.
|
BitsetArrayIntVarImpl(String name,
int[] sortedValues,
Model model)
Creates an
IntVar based on an array of non-consecutive but ordered values. |
BitsetIntVarImpl(String name,
int[] sortedValues,
Model model)
Create an enumerated IntVar based on a bitset
|
BitsetIntVarImpl(String name,
int min,
int max,
Model model)
Create an enumerated IntVar based on a bitset
|
BoolVarImpl(String name,
Model model)
Create a BoolVar {0,1} or {true, false}
|
FixedBoolVarImpl(String name,
int constant,
Model model) |
FixedIntVarImpl(String name,
int constante,
Model model)
Creates a variable whom domain is natively reduced to the singleton {
constante }. |
FixedRealVarImpl(String name,
double value,
Model model)
Create the shared data of any type of variable.
|
IntervalIntVarImpl(String name,
int min,
int max,
Model model)
Create a bounded domain IntVar : [min,max]
|
RealVarImpl(String name,
double lb,
double ub,
double precision,
Model model) |
SetVarImpl(String name,
int[] value,
Model model)
Creates a fixed Set variable, equal to
value |
SetVarImpl(String name,
int[] ker,
SetType kerType,
int[] env,
SetType envType,
Model model)
Creates a Set variable
|
SetVarImpl(String name,
ISet lb,
ISet ub,
Model model)
Creates a set variable, of domain
[lb, ub]
Beware : Use this constructor with caution (domain is directly accessible)
lb and ub should be created properly (e.g. lb subset of ub) and should not be modified externally
Both lb and ub should be backtrackable sets (stored sets): use SetFactory.makeStoredSet to build them |
SetVarImpl(String name,
ISet value,
Model model)
Creates a fixed Set variable, equal to
value
Beware : Use this constructor with caution (domain is directly accessible)
value should be created properly and should not be modified afterward |
Constructor and Description |
---|
DirectedGraph(Model model,
int n,
SetType type,
boolean allNodes)
Creates an empty backtrable graph of n nodes
Allocates memory for n nodes (but they should then be added explicitly,
unless allNodes is true).
|
UndirectedGraph(Model model,
int n,
SetType type,
boolean allNodes)
Creates an empty backtrable undirected graph.
|
Modifier and Type | Method and Description |
---|---|
static ISet |
SetFactory.makeStoredSet(SetType type,
int offSet,
Model model)
Creates a stored set of integers greater or equal than
offSet
Such a set is restored after a backtrack |
Constructor and Description |
---|
StdSet(Model model,
ISet set) |
Modifier and Type | Method and Description |
---|---|
static IntVar[] |
VariableUtils.toIntVar(Model model,
int... values)
Transform an array of int to an array of fixed IntVar
|
Copyright © 2017. All rights reserved.