{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:52:25Z","timestamp":1715241145532},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T00:00:00Z","timestamp":1179532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s10732-007-9028-0","type":"journal-article","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T11:13:43Z","timestamp":1179573223000},"page":"23-67","source":"Crossref","is-referenced-by-count":10,"title":["Enhancing set constraint solvers with lexicographic bounds"],"prefix":"10.1007","volume":"14","author":[{"given":"Andrew","family":"Sadler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmen","family":"Gervet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,5,19]]},"reference":[{"key":"9028_CR1","unstructured":"Azevedo, F.: Constraint solving over multi-valued logics. Application to digital circuits. In: Frontiers in Artificial Intelligence and Applications. IOS, Amsterdam (2003)"},{"key":"9028_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1007\/3-540-44957-4_28","volume-title":"Computational Logic\u2014CL (2000)","author":"F. Azevedo","year":"2000","unstructured":"Azevedo, F., Barahona, P.: Modeling digital circuits problems with set constraints. In: Lloyd, J., et al. (eds.) Computational Logic\u2014CL (2000). Lecture Notes in Computer Science, vol.\u00a01861, pp.\u00a0414\u2013428. Springer, Berlin (2000)"},{"key":"9028_CR3","unstructured":"Barnier, N., Brisset, P.: Facile: a functional constraint library. In: CICLOPS\u201901 Workshop, held alongside with CP-2001, 2001"},{"key":"9028_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b98484","volume-title":"Proceedings of CP-2004","author":"N. Barnier","year":"2004","unstructured":"Barnier, N., Brisset, P.: Solving the Kirkman\u2019s schoolgirl problem in a few seconds. In: Wallace, M. (ed.) Proceedings of CP-2004. Lecture Notes in Computer Science, vol.\u00a03258. Springer, Berlin (2004)"},{"key":"9028_CR5","series-title":"Lecture Notes in Computer Science","first-page":"11","volume-title":"Constraint Programming: Basics and Trends","author":"F. Benhamou","year":"1995","unstructured":"Benhamou, F.: Interval constraint logic programming. In: Podelski, A. (ed.) Constraint Programming: Basics and Trends. Lecture Notes in Computer Science, vol. 910, pp. 11\u201312. Springer, Berlin (1995)"},{"key":"9028_CR6","volume-title":"Principles of Combinatorics","author":"C. Berge","year":"1971","unstructured":"Berge, C.: Principles of Combinatorics. Academic, New York (1971)"},{"key":"9028_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of CP-2004","author":"C. Bessi\u00e8re","year":"2004","unstructured":"Bessi\u00e8re, C., Hnich, B., H\u00e9brard, E., Walsh, T.: Disjoint, partition and intersection constraints for sets and multiset variables. In: Wallace, M. (ed.) Proceedings of CP-2004. Lecture Notes in Computer Science, vol. 3258. Springer, Berlin (2004a)"},{"key":"9028_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of CP-2004","author":"C. Bessi\u00e8re","year":"2004","unstructured":"Bessi\u00e8re, C., Hnich, B., H\u00e9brard, E., Walsh, T.: The tractability of global constraints. In: Wallace, M. (ed.) Proceedings of CP-2004. Lecture Notes in Computer Science, vol. 3258. Springer, Berlin (2004b)"},{"issue":"3","key":"9028_CR9","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24(3), 293\u2013318 (1992)","journal-title":"ACM Comput. Surv."},{"key":"9028_CR10","unstructured":"Campbell, R.: A minimum distances basketball scheduling problem (1976)"},{"key":"9028_CR11","volume-title":"The CRC Handbook of Combinatorial Designs","year":"1998","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds.): The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (1998)"},{"key":"9028_CR12","series-title":"London Mathematical Society Lecture Note Series","volume-title":"Surveys in Combinatorics","author":"C.J. Colbourn","year":"1999","unstructured":"Colbourn, C.J., Dinitz, J.H., Stinson: Applications of combinatorial designs to communications, cryptography, and networking. In: Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 187. Cambridge University Press, Cambridge (1999)"},{"key":"9028_CR13","unstructured":"Crawford, J., Ginsberg, M., Luks, E.M., Roy, A.: Symmetry breaking predicates for search problems. In: Fifth Int. Conf. on Knowledge Rep. and Reasoning, 1996"},{"key":"9028_CR14","unstructured":"Eremin, A., Ajili, F., Rodosek, R.: A Set-based approach to the optimal IGP weight setting problem. In: Proceedings of INOC-2005 (2005)"},{"key":"9028_CR15","first-page":"93","volume-title":"Proceedings of CP\u201901","author":"T. Fahle","year":"2001","unstructured":"Fahle, T., Schamberger, S., Sellman, M.: Symmetry breaking. In: Proceedings of CP\u201901, pp. 93\u2013107. Springer, Berlin (2001)"},{"key":"9028_CR16","volume-title":"Proceedings of CP02","author":"P. Flener","year":"2002","unstructured":"Flener, P., Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetries in matrix models. In: Proceedings of CP02. Springer, Berlin (2002)"},{"key":"9028_CR17","unstructured":"Gent, I.P., Prosser, P., Smith, B.M.: A 0\/1 encoding of the gaclex for pairs of vectors. In: ECAI-W9 Modelling and Solving Problems with Constraints (2002)"},{"key":"9028_CR18","unstructured":"Gervet, C.: Conjunto: constraint logic programming with finite set domains. In: Bruynooghe, M. (ed.) Proceedings of ILPS-1994"},{"key":"9028_CR19","unstructured":"Gervet, C.: Set intervals in constraint logic programming: definition and implementation of a language. Ph.D. thesis, Universit\u00e9 de Franche-Comt\u00e9, France (September 1995). European thesis (in English)"},{"key":"9028_CR20","doi-asserted-by":"crossref","unstructured":"Gervet, C.: Interval propagation to reason about sets: definition and implementation of a practical language. Constraints J. 1(3), (1997)","DOI":"10.1007\/BF00137870"},{"key":"9028_CR21","unstructured":"Godsil, C.D.: Linear algebra and designs. Manuscript (229\u00a0p.) (1995)"},{"key":"9028_CR22","doi-asserted-by":"crossref","unstructured":"Hawkins, P., Lagoon, V., Stuckey, P.: Solving set constraint satisfaction problems using ROBDDs. J. Artif. Intell. Res. 24 (2005)","DOI":"10.1613\/jair.1638"},{"key":"9028_CR23","unstructured":"Hnich, B., Kiziltan, Z., Walsh, T.: Combining symmetry breaking with other constraints: lexicographic ordering with sums. In: Proceedings of SymCon Workshop Held alongside CP\u201903, 2003"},{"key":"9028_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of PLILP\u201992","author":"C. Holzbaur","year":"1992","unstructured":"Holzbaur, C., Metastructures versus attributed variables in the context of extensible unification. In: Bruynooghe, M., Wirsing, M. (eds.) Proceedings of PLILP\u201992. Lecture Notes in Computer Science, vol. 631. Springer, Berlin (1992)"},{"key":"9028_CR25","unstructured":"Ilog: User\u2019s manual. ILOG Solver 6.0 (September 2003)"},{"key":"9028_CR26","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of PLILP-1990","author":"S. Huitouze Le","year":"1990","unstructured":"Le\u00a0Huitouze, S.: A new datastructure for implementing extensions to prolog. In: Proceedings of PLILP-1990. Lecture Notes in Computer Science, vol. 456. Springer, Berlin (1990)"},{"key":"9028_CR27","doi-asserted-by":"crossref","unstructured":"Kiziltan, Z.: Symmetry breaking ordering constraints. Ph.D. thesis, Uppsala University, Sweden (2004)","DOI":"10.1007\/978-3-540-45193-8_103"},{"key":"9028_CR28","unstructured":"Laburthe, F.: CHOCO: implementing a CP kernel. In: Proceedings of TRICS, held alongside CP-2000, http:\/\/choco.sourceforge.net\/ (2000)"},{"key":"9028_CR29","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings CP-2004","author":"V. Lagoon","year":"2004","unstructured":"Lagoon, V., Stuckey, P.J.: Set domain propagation using ROBDDs. In: Wallace, M. (ed.) Proceedings CP-2004. Lecture Notes in Computer Science, vol. 3258. Springer, Berlin (2004)"},{"issue":"34","key":"9028_CR30","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0743-1066(93)90045-I","volume":"16","author":"J.H.M. Lee","year":"1993","unstructured":"Lee, J.H.M., van\u00a0Emden, H.: Interval computation as deduction in CHIP. J. Logic Program. 16(34), 255\u2013276 (1993)","journal-title":"J. Logic Program."},{"key":"9028_CR31","series-title":"Annals of Discrete Mathematics","volume-title":"Topics on Steiner Systems","author":"C.C. Lindner","year":"1980","unstructured":"Lindner, C.C., Rosa, A.: Topics on Steiner Systems. Annals of Discrete Mathematics, vol.\u00a07. North-Holland, Amsterdam (1980)"},{"key":"9028_CR32","unstructured":"Liu, H., Tobagi, F.: A novel efficient technique for traffic grooming in WDM SONET with multiple line speeds. In: Proceedings of IEEE ICC (2004)"},{"key":"9028_CR33","doi-asserted-by":"crossref","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. (1977)","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"9028_CR34","unstructured":"Mozart\/Oz, http:\/\/www.mozart-oz.org\/ (2004)"},{"key":"9028_CR35","unstructured":"M\u00fcller, T.: Solving set partitioning problems with constraint programming. In: Proceedings of PAPPACT-1998 (1998)"},{"key":"9028_CR36","unstructured":"M\u00fcller, T., M\u00fcller, M.: Finite set constraints in Oz. In: Bry, F., et al. (eds.) 13 Workshop Logische Programmierung (WLP \u201997). Technical Report 13, Technical University of Munich, Munich (1997)"},{"key":"9028_CR37","volume-title":"Constraint Logic Programming: Selected Papers","author":"W. Older","year":"1993","unstructured":"Older, W., Vellino, A.: Constraint arithmetic on real intervals. In: Benhamou, F., Colmerauer, A. (eds.) Constraint Logic Programming: Selected Papers. MIT, Cambridge (1993)"},{"key":"9028_CR38","unstructured":"Puget J.-F.: PECOS: a high level constraint programming language. In: Proceedings of Spicis (1992)"},{"key":"9028_CR39","unstructured":"Puget, J.-F.: A fast algorithm for the bound consistency of alldiff constraints. In: Proceedings of AAAI\u201998 (1998)"},{"key":"9028_CR40","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings CP-2004","author":"C.-G. Quimper","year":"2004","unstructured":"Quimper, C.-G., Lopez-Ortiz, A., van Beek, P., Golynski, A.: Improved algorithms for the global cardinality constraint. In: Wallace, M. (ed.) Proceedings CP-2004. Lecture Notes in Computer Science, vol. 3258. Springer, Berlin (2004)"},{"key":"9028_CR41","unstructured":"Sadler, A.: Strengthening finite set constraint solvers through active use of problem structure, symmetries and cardinality information. Ph.D. thesis, University of London, Imperial College (2005)"},{"key":"9028_CR42","unstructured":"Sadler, A., Gervet, C.: Global reasoning on sets. In: FORMUL\u201901 Workshop on Modelling and Problem Formulation held alongside CP-2001, Paphos, Cyprus (2001)"},{"key":"9028_CR43","unstructured":"Sadler, A., Gervet, C.: Global filtering for the disjointness constraint on fixed cardinality sets. Technical report ICPARC-04-02 (March 2004)"},{"key":"9028_CR44","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of CP-2004","author":"A. Sadler","year":"2004","unstructured":"Sadler, A., Gervet, C.: Hybrid set domains to strengthen constraint propagation and reduce symmetries. In: Wallace, M. (ed.) Proceedings of CP-2004. Lecture Notes in Computer Science. Springer, Berlin (2004)"},{"key":"9028_CR45","unstructured":"Schimpf, J., Cheadle, A., Harwey, W., Sadler, A., Shen, K., Walllace, M.: ECL i PS e : Technical report 03-1, IC-Parc, Imperial College, London (2003)"},{"key":"9028_CR46","unstructured":"Sellman, M., van Hentenryck, P.: Structural symmetry breaking. In: Proceedings of IJCAI\u201905, Edinburgh, UK (2005)"},{"key":"9028_CR47","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"H.D. Sherali","year":"2001","unstructured":"Sherali, H.D., Smith, J.C.: Improving discrete model representations via symmetry considerations. Manag. Sci. 47, 1396\u20131407 (2001)","journal-title":"Manag. Sci."},{"key":"9028_CR48","unstructured":"Smith, B.M.: Search strategies for optimization: modelling the sonet problem. In: 2nd International Workshop on Reformulating CSPs, 2003"},{"key":"9028_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b105497","volume-title":"Proceedings of CP\u2019AI-OR\u201905","author":"B.M. Smith","year":"2005","unstructured":"Smith, B.M.: Symmetry and search in a network design problem. In: Proceedings of CP\u2019AI-OR\u201905. Lecture Notes in Computer Science, vol. 3524. Springer, Berlin (2005)"},{"key":"9028_CR50","unstructured":"Smith, J.C.: Tight discrete formulations to enhance solvability with applications to production, telecommunications and air transportation problems. Ph.D. thesis, Blacksburg, Virginia (2000)"},{"key":"9028_CR51","unstructured":"Somenzi, F.: CUDD: Colorado University decision diagram package. http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/ (2005)"},{"key":"9028_CR52","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of CP-2003","author":"T. Walsh","year":"2003","unstructured":"Walsh, T.: Consistency and propagation with multiset constraints: a formal viewpoint. In: Proceedings of CP-2003. Lecture Notes in Computer Science. Springer, Berlin (2003)"},{"key":"9028_CR53","unstructured":"Zhou, N.F.: B-Prolog. http:\/\/www.probp.com\/ (2004)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9028-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-007-9028-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9028-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T22:32:40Z","timestamp":1683844360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-007-9028-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,19]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["9028"],"URL":"https:\/\/doi.org\/10.1007\/s10732-007-9028-0","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,19]]}}}