Abstract
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 \(\sum_{x_i \in X} x_i = s\). We propose an Θ(n) bound-consistency algorithm for IncreasingSum.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Choco: An open source Java CP library, documentation manual (2011), http://www.emn.fr/z-info/choco-solver/
Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1979) ISBN 0-7167-1045-5
Harvey, W., Schimpf, J.: Bounds Consistency Techniques for Long Linear Constraints. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 39–46. Springer, Heidelberg (2002)
Régin, J.-C., Rueher, M.: Inequality-sum: a global constraint capturing the objective function. RAIRO - Operations Research 39, 123–139 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petit, T., Régin, JC., Beldiceanu, N. (2011). A Θ(n) Bound-Consistency Algorithm for the Increasing Sum Constraint. In: Lee, J. (eds) Principles and Practice of Constraint Programming – CP 2011. CP 2011. Lecture Notes in Computer Science, vol 6876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23786-7_54
Download citation
DOI: https://doi.org/10.1007/978-3-642-23786-7_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23785-0
Online ISBN: 978-3-642-23786-7
eBook Packages: Computer ScienceComputer Science (R0)