| AbstractStrategy<V extends Variable> |
A search strategy provides decisions to go down in the search space.
|
| ConflictOrderingSearch<V extends Variable> |
Conflict Ordering Search
Composite heuristic which hacks a mainStrategy by forcing the
use of variables involved in recent conflicts
See "Conflict Ordering Search for Scheduling Problems", Steven Gay et al., CP2015.
|
| FindAndProve<V extends Variable> |
Enables to switch from one heuristic to another once a solution has been found
|
| FullyRandom |
Project: choco-solver.
|
| GreedyBranching |
|
| IntStrategy |
Class to perform branching decisions over integer variables
|
| LastConflict<V extends Variable> |
Last Conflict heuristic
Composite heuristic which hacks a mainStrategy by forcing the
use of variables involved in recent conflicts
|
| RealStrategy |
Define a strategy based on RealVar.
|
| SetStrategy |
Strategy for branching on set variables
|
| StrategiesSequencer |
A StrategiesSequencer is class for AbstractStrategy composition.
|