A Theta(n) Bound-Consistency Algorithm for the Increasing Sum Constraint
Résumé
Given a sequence of variables X = 〈x 0, x 1, ..., x n − 1 〉, we consider the IncreasingSum constraint, which imposes ∀ i ∈ [0, n − 2] x i ≤ x i + 1, and ∑xi∈Xxi=s . We propose an Θ(n) bound-consistency algorithm for IncreasingSum