A Θ(n) Bound-Consistency Algorithm for the Increasing Sum Constraint

Abstract

Given a sequence of variables X = 〈x0, x1, . . . , xn−1〉, we consider the IncreasingSum constraint, which imposes ∀i ∈ [0, n − 2] xi ≤ xi+1, and ∑ xi∈X xi = s. We propose an Θ(n) bound-consistency algorithm for IncreasingSum. 
DOI: 10.1007/978-3-642-23786-7_54

Topics

2 Figures and Tables