{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T23:57:11Z","timestamp":1772668631147,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441205","type":"print"},{"value":"9783540461357","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_7","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T01:59:47Z","timestamp":1179194387000},"page":"93-108","source":"Crossref","is-referenced-by-count":38,"title":["Global Constraints for Lexicographic Orderings"],"prefix":"10.1007","author":[{"given":"Alan","family":"Frisch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brahim","family":"Hnich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeynep","family":"Kiziltan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Miguel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"N. Beldiceanu. Global constraints as graph properties on a structured network of elementary constraints of the same type. In Proc. of CP\u20192000, pages 52\u201366. Springer, 2000.","DOI":"10.1007\/3-540-45349-0_6"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"C. Bessi\u00e9re, P. Meseguer, E. C. Freuder, and J. Larrosa. On forward checking for non-binary constraint satisfaction. In Proc. of CP\u201999, pages 88\u2013102. Springer, 1999.","DOI":"10.1007\/978-3-540-48085-3_7"},{"key":"7_CR3","unstructured":"C. Bessi\u00e9re and J. C. R\u00e9gin. Arc consistency for general constraint networks: Preliminary results. In Proc. of IJCAI\u201997, pages 398\u2013404. Morgan Kaufmann, 1997."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M. Ehrgott","year":"2000","unstructured":"M. Ehrgott and X. Gandibleux. A survey and annotated bibliography of multi-objective combinatorial optimization. OR Spektrum, 22:425\u2013460, 2000.","journal-title":"OR Spektrum"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"P. Flener, A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh. Breaking row and column symmetries in matrix models. In Proc. of CP\u20192002. Springer, 2002.","DOI":"10.1007\/3-540-46135-3_31"},{"key":"7_CR6","unstructured":"P. Flener, A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Matrix modelling. Technical Report APES-36-2001, APES group, 2001. Available from http:\/\/www.dcs.st-and.ac.uk\/~apes\/reports\/apes-36-2001.ps.gz . Presented at Formul\u201901, CP\u20192001 post-conference workshop."},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1145\/4221.4225","volume":"32","author":"E. Freuder","year":"1985","unstructured":"E. Freuder. A sufficient condition for backtrack-bounded search. Journal of the Association for Computing Machinery, 32(4):755\u2013761, 1985.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"7_CR8","unstructured":"A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Global constraints for lexicographical orderings. Technical Report APES-51-2002, APES group, 2002. Available from http:\/\/www.dcs.st-and.ac.uk\/~apes\/reports\/apes-51-2001.ps.gz ."},{"issue":"1\u20132","key":"7_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0004-3702(00)00051-5","volume":"123","author":"I. P. Gent","year":"2000","unstructured":"I. P. Gent, K. Stergiou, and T. Walsh. Decomposable constraints. Artificial Intelligence, 123(1\u20132):133\u2013156, 2000.","journal-title":"Artificial Intelligence"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"P. Van Hentenryck, L. Michel, L. Perron, and J. C. R\u00e9gin. Constraint programming in OPL. In Proc. of PPDP\u201999, pages 98\u2013116. Springer, 1999.","DOI":"10.1007\/10704567_6"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:25:21Z","timestamp":1556396721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002]]}}}