Absolute value constraint

Abstract class the most of the constraints should extend.

An abstract search method that can be used concurrently: it is stoppable and can be work-stealed. An additional constraint w.r.t. AbstractSearchMetho

An abstract search method, implementing all the parts needed, but the search method itself. @param <T> the type of the branching

Represents a scheduling activity i.e. an interval variable that consumes an ammount of resource over time. @author Pierre Schaus, Charles Thomas

Arc Consistent AllDifferent Constraint Algorithm described in "A filtering algorithm for constraints of difference in CSPs" J-C. Régin, AAAI-94

Exclusive alternative between intervals. If interval {@code real} is present, then exactly {@code n} intervals in {@code alternatives} are present and

Alternative Constraint with cardinality: Enforces that if the interval a is present, then c intervals from the array alt must be present and synchroni

Among constraint

Domain Consistency Filtering for AtLeastNValue constraint. @author Pierre Schaus pschaus@gmail.com

A very simple ModelProxy which is not thread-safe. Use this class only when you explicitly want to avoid a ModelDispatcher, which is thread-safe.

BinPacking constraint. {@code x[i]} is the bin assigned to item {@code i}; {@code loads[b]} is derived from the assignments and weights. Only {@code x

The {@code BinPacking} constraint ensures that a set of items with given weights are packed into bins such that each bin's total weight respects a giv

This class provides algorithms for the Bin Packing. @author pschaus

A Binary Knapsack constraint ensures that the total load is equal to the sum of the weights of the selected items. <p>This constraint models <pre>

Bitset abstract class

Phase-based black-box search orchestrator for modeling-level CP problems. <p> A {@code BlackBoxSearch} executes a sequence of configured phases, each

Boolean variable, that can be used as a 0-1 IntVar. <p>0 corresponds to false, and 1 corresponds to true

Interface implemented by every Constraint @see AbstractCPConstraint

CP implementation of a Cumulative Function @author Pierre Schaus, Charles Thomas, Augustin Delecluse

Factory to create {@link CPSolver}, {@link CPIntVar}, {@link CPConstraint}, {@link CPSeqVar} and some modeling utility methods. <p> CPFactory may need

A fixed set variable that contains a specific set of values.

CP implementation of a Flat Cumulative Function @author Pierre Schaus, Charles Thomas, Augustin Delecluse

Implementation of a variable with a {@link SparseSetDomain}.

A view on a variable of type {@code a x}

A view on a variable of type {@code x+o}

A view on a variable of type {@code -x}

TODO @author Pierre Schaus

TODO @author Pierre Schaus

Provides a view of a CPIntervalVar that is delayed by a fixed offset value.

CP implementation of a Minus Cumulative Function @author Pierre Schaus, Charles Thomas, Augustin Delecluse

CP implementation of a Plus Cumulative Function @author Pierre Schaus, Charles Thomas, Augustin Delecluse

CP implementation of a Pulse Cumulative Function @author Pierre Schaus, Charles Thomas, Augustin Delecluse

A set variable is a variable that represents a set of integers from an original universe set. Its domain is conceptually represented by: - a set of in

Implementation of a set variable. <p> A set variable is a variable that can take a set of values from a finite domain. The possible values are represe

CP implementation of a Step at End Cumulative Function @author Pierre Schaus, Charles Thomas, Augustin Delecluse

CP implementation of a Step at Start Cumulative Function @author Pierre Schaus, Charles Thomas, Augustin Delecluse

CP implementation of a Sum Cumulative Function @author Pierre Schaus, Charles Thomas, Augustin Delecluse

capacitated vehicle routing, with time windows