Abstract
We propose new filtering algorithms for the Sequence constraint and some extensions of the Sequence constraint based on network flows. We enforce domain consistency on the Sequence constraint in O(n 2) time down a branch of the search tree. This improves upon the best existing domain consistency algorithm by a factor of O(logn). The flows used in these algorithms are derived from a linear program. Some of them differ from the flows used to propagate global constraints like Gcc since the domains of the variables are encoded as costs on the edges rather than capacities. Such flows are efficient for maintaining bounds consistency over large domains and may be useful for other global constraints.
NICTA is funded by the Australian Government as represented by the Department of Broadband, Communications and the Digital Economy and the Australian Research Council.
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
Régin, J.C.: A filtering algorithm for constraints of difference in csps. In: Proc. of the 12th National Conf. on AI (AAAI 1994), vol. 1, pp. 362–367 (1994)
Régin, J.C.: Generalized arc consistency for global cardinality constraint. In: Proc. of the 12th National Conf. on AI (AAAI 1996), pp. 209–215 (1996)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Mathematical and Computer Modelling 12, 97–123 (1994)
Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: The slide meta-constraint. Technical report (2007)
Régin, J.C., Puget, J.F.: A filtering algorithm for global sequencing constraints. In: Proc. of the 3th Int. Conf. on Principles and Practice of Constraint Programming, pp. 32–46 (1997)
Beldiceanu, N., Carlsson, M.: Revisiting the cardinality operator and introducing cardinality-path constraint family. In: Proc. of the Int. Conf. on Logic Programming, pp. 59–73 (2001)
Régin, J.C.: Combination of among and cardinality constraints. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 288–303. Springer, Heidelberg (2005)
Hoeve, W.J.v., Pesant, G., Rousseau, L.M., Sabharwal, A.: Revisiting the sequence constraint. In: Proc. of the 12th Int. Conf. on Principles and Practice of Constraint Programming, pp. 620–634 (2006)
Brand, S., Narodytska, N., Quimper, C.G., Stuckey, P., Walsh, T.: Encodings of the sequence constraint. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 210–224. Springer, Heidelberg (2007)
Veinott Jr., A.F., Wagner, H.: Optimal capacity scheduling I. Operations Research 10(4), 518–532 (1962)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM 45, 753–782 (1998)
Solnon, C., Cung, V.D., Nguyen, A., Artigues, C.: The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF 2005 challenge problem. European Journal of Operational Research (EJOR) (in press, 2008)
Régin, J.C.: Arc consistency for global cardinality constraints with costs. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 390–404. Springer, Heidelberg (1999)
van Hoeve, W.J., Pesant, G., Rousseau, L.M.: On global warming: Flow-based soft global constraints. J. Heuristics 12(4-5), 347–373 (2006)
Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. Journal of Computer and Systems Sciences 13, 335–379 (1976)
Bixby, R., Cunningham, W.: Converting linear programs to network problems. Mathematics of Operations Research 5, 321–357 (1980)
Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons, Inc., Chichester (1986)
Beldiceanu, N.: Global constraint catalog. T-2005-08, SICS Technical Report (2005)
Cotton, S., Maler, O.: Fast and flexible difference constraint propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 170–183. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maher, M., Narodytska, N., Quimper, CG., Walsh, T. (2008). Flow-Based Propagators for the SEQUENCE and Related Global Constraints. In: Stuckey, P.J. (eds) Principles and Practice of Constraint Programming. CP 2008. Lecture Notes in Computer Science, vol 5202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85958-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85957-4
Online ISBN: 978-3-540-85958-1
eBook Packages: Computer ScienceComputer Science (R0)