Binary Branching with custom variable heuristic and natural value ordering. @param variableSelector returns the next variable to bind, null if all va

@param var the variable @return the number of value in the domain of a var that are included in vals

Checks if the set is empty @return true if the set is empty

Returns true if the set variable is fixed. A set variable is fixed if its cardinality is fixed and the number of included values is equal to the minim

Creates an array of new interval variable with a startMin of 0, an unbounded end and unfixed length @param cp the solver @param n the number of inte

Returns the number of predecessors of a node. @param node node. @return the number of predecessors.

Returns the number of successors of a node. @param node node. @return the number of successors matching the status.

Asks that {@link CPConstraint#propagate()} is called whenever an insertion is removed We say that a <i>removeInsert</i> event occurs. @param c the co

Asks that {@link CPConstraint#propagate()} is called whenever a node is required. We say that an <i>require</i> event occurs. @param c the constraint

Relax the objective it can be deteriorated

Remove all the activities from this theta-tree

Restores the state up the the given level. @param level the level, a non negative number between 0 and {@link #getLevel()}

Schedules the constraint to be propagated by the fix-point. @param c the constraint to be scheduled

Activates or deactivates the filtering of the objective @param activate

Create a constraint that enforces the start of var1 to be equal to start @param var1 the interval variable @param start the start value @return a co

Computes the strongly connected components of the graph @param graph the input graph on which to compute the strongly connected component

Asks that the closure is called whenever an exclusion happens. @param f the closure.

Asks that the closure is called a node is required. @param f the closure.

Assert the invariants maintained within a sequence This is only relevant for testing stuff like the maintaining of the counters, which is supposedly d

Returns the value that is just before the given value in the domain of the variable if any, if the value is less than or equal to the minimum of the d

Shortest path distance from the src to all other nodes using Bellman-Ford algorithm. Return null if a negative cycle is detected.

Returns the incumbent objective value, if any.

Called whenever the domain becomes a single value.

Compute possible ends for given job starts and lenghts

Estimate domain size for an interval variable.

@return true if one domain was changed by the edge finding algo

Moves all possible values into the set of excluded values. @return true if the partition of possible values has been reduced

Applies all the filtering algorithms Overload Checker, Not-Last, Detectable Precedence in a loop until a fix point is reached, or an inconsistency is

Returns the current bound @return the current bound

Set the load at the visit of a node @param node node whose load must be set @param load load set at the given position @throws InconsistencyException

Set the load after the visit of a node @param node node after which the load must be set @param load load set after the given position @throws Incons

Insert activity in leaf nodes at given position such that it is taken into account for the {@link #getEct()} computation. @param pos the index of the

This method operates on the shifted value (one cannot shift now). @param val the setValue to lookup for membership @return true if val is in the set,

Returns a boolean variable representing whether the interval variable var1 ends at or before the start of the interval variable var2. This relation is

Tells if the specified value belongs to the excluded partition E. @param val the value to test. @return true if val belongs to the included partition

Returns a boolean variable representing whether one variable is larger or equal to the given constant. This relation is enforced by the {@link IsLessO

Create a branching closure for one side of a choice. The closure applies the branch, updates the rating, and re-throws any failure. @param choice

Create a branching closure for one side of a choice. The closure applies the branch, updates the rating, and re-throws any failure. @param choice

@param a @return the maximum value in a

Returns a string representation of the members, ordered following the sequence from {@code start()} to {@code end()}, separated by " -> ". @return st

Returns the minimum value in the set. @return the minimum value in the set

Returns the number of successors of a node. @param node node. @return the number of successors matching the status.

The old max of the domain in previous call to Constraint#propagate @return the previous maximum of the domain

The old min of the domain in previous call to Constraint#propagate @return the previous minimum

Solves an optimization model with default black-box settings.

@return false if the overload checker detects an overload, true if no overload is detected

Asks that {@link CPConstraint#propagate()} is called whenever an exclusion happens. We say that an <i>exclude</i> event occurs. @param c the constrai