Class Summary |
Code |
Code is a list of conditions extracted from a
currently solved network. |
Condition |
Codition abstract class represents a condition of a
constraint under the current solution. |
Constraint |
An abstract class for constraints. |
DefaultSolver |
A branch-and-bound solver. |
Domain |
Domains. |
Element |
Element constraints. |
Equals |
Equals constraint. |
IBBSearch |
Iterativ Branch-and-Bound Search. |
IntArith |
IntArith constraint implements
arithmetic binary operations on integers. |
IntComparison |
IntComparison constraint implements
comparison relations on integers. |
IntDomain |
IntDomain class represents domains on integers. |
IntFunc |
IntFunc constraint implements
arithmetic unary function on integers. |
IntVariable |
Integer variables. |
LocalSearch |
A super class of local search solvers, and also an implementation of a random
walk solver. |
Monitor |
Monitor class. |
Network |
Constraint networks. |
NotEquals |
NotEquals constraint. |
Operation |
Operations. |
ParallelSolver |
Parallel solver. |
Relation |
Relation constraints. |
SASearch |
Simulated Annealing Search. |
Sequential |
Sequential constraints
constructed from
an array of n integer variables (v[0], ..., v[n-1]) and
an array of n positive integer constants (a[0], ..., a[n-1]). |
Serialized |
Serialized constraints
constructed from
an array of n integer variables (v[0], ..., v[n-1]) and
an array of n positive integer constants (a[0], ..., a[n-1]). |
Solution |
Solutions. |
Solver |
An abstract class for constraint solvers. |
TabooSearch |
Taboo Search. |
Trail |
Trail class implements trail stacks. |
Variable |
Variables. |