{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:05:41Z","timestamp":1742915141567,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642213106"},{"type":"electronic","value":"9783642213113"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21311-3_6","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T08:47:22Z","timestamp":1304585242000},"page":"36-52","source":"Crossref","is-referenced-by-count":1,"title":["The AllDifferent Constraint with Precedences"],"prefix":"10.1007","author":[{"given":"Christian","family":"Bessiere","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Narodytska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"J.L. Lauriere","year":"1978","unstructured":"Lauriere, J.L.: ALICE: a language and a program for stating and solving combinatorial problems. Artificial Intelligence\u00a010, 29\u2013127 (1978)","journal-title":"Artificial Intelligence"},{"key":"6_CR2","unstructured":"R\u00e9gin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the 12th National Conference on AI, Association for Advancement of Artificial Intelligence, pp. 362\u2013367 (1994)"},{"key":"6_CR3","unstructured":"Leconte, M.: A bounds-based reduction scheme for constraints of difference. In: Proceedings of Second International Workshop on Constraint-based Reasoning, Constraint 1996 (1996)"},{"key":"6_CR4","unstructured":"Puget, J.: A fast algorithm for the bound consistency of alldiff constraints. In: 15th National Conference on Artificial Intelligence, Association for Advancement of Artificial Intelligence, pp. 359\u2013366 (1998)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-45349-0_23","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., Thiel, S.: Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, p. 306. Springer, Heidelberg (2000)"},{"key":"6_CR6","unstructured":"Lopez-Ortiz, A., Quimper, C., Tromp, J., van Beek, P.: A fast and simple algorithm for bounds consistency of the alldifferent constraint. In: Proceedings of the 18th International Conference on AI, International Joint Conference on Artificial Intelligence (2003)"},{"key":"6_CR7","unstructured":"Stergiou, K., Walsh, T.: The difference all-difference makes. In: Proceedings of 16th IJCAI, International Joint Conference on Artificial Intelligence (1999)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.14.4.387.2830","volume":"14","author":"M. Milano","year":"2002","unstructured":"Milano, M., Ottosson, G., Refalo, P., Thorsteinsson, E.: The role of integer programming techniques in constraint programming\u2019s global constraints. INFORMS Journal on Computing\u00a014, 387\u2013402 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1287\/ijoc.13.2.96.10515","volume":"13","author":"H. Williams","year":"2001","unstructured":"Williams, H., Yan, H.: Representations of the all different predicate of constraint satisfaction in integer programming. INFORMS Journal on Computing\u00a013, 96\u2013103 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-45193-8_4","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"T. Walsh","year":"2003","unstructured":"Walsh, T.: Constraint patterns. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 53\u201364. Springer, Heidelberg (2003)"},{"key":"6_CR11","unstructured":"Beldiceanu, N., Bourreau, E., Rivreau, D., Simonis, H.: Solving Resource-constrained Project Scheduling Problems with CHIP. In: 5th International Workshop on Project Management and Scheduling (PMS 1996), Poznan, pp. 35\u201338 (1996)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-45406-3_6","volume-title":"Constraints in Computational Logics. Theory and Applications","author":"H. Simonis","year":"2001","unstructured":"Simonis, H.: Building industrial applications with constraint programming. In: Comon, H., March\u00e9, C., Treinen, R. (eds.) CCL 1999. LNCS, vol.\u00a02002, p. 271. Springer, Heidelberg (2001)"},{"key":"6_CR13","unstructured":"Debruyne, R., Bessi\u00e8re, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: Proceedings of the 15th IJCAI, International Joint Conference on Artificial Intelligence, pp. 412\u2013417 (1997)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"M. Garey","year":"1981","unstructured":"Garey, M., Johnson, D., Simons, B., Tarjan, R.: Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM J. Comput.\u00a010, 256\u2013269 (1981)","journal-title":"SIAM J. Comput."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/11564751_37","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"J.-F. Puget","year":"2005","unstructured":"Puget, J.-F.: Breaking all value symmetries in surjection problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 490\u2013504. Springer, Heidelberg (2005)"},{"key":"6_CR16","first-page":"1","volume":"3","author":"J.F. Puget","year":"2007","unstructured":"Puget, J.F.: Symmetry in injective problems. Constraint Programming Letters\u00a03, 1\u201320 (2007)","journal-title":"Constraint Programming Letters"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Thiel, S.: Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 306\u2013319. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45349-0_23"},{"key":"6_CR18","unstructured":"Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.G., Walsh, T.: Decompositions of all different, global cardinality and related constraints. In: Proceedings of 21st IJCAI, International Joint Conference on Artificial Intelligence, pp. 419\u2013424 (2009)"},{"key":"6_CR19","volume-title":"Proc. of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010)","author":"C. Bessiere","year":"2010","unstructured":"Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.G., Walsh, T.: Propagating conjunctions of alldifferent constraints. In: Fox, M., Poole, D. (eds.) Proc. of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010). AAAI Press, Menlo Park (2010)"},{"key":"6_CR20","unstructured":"Hnich, B., Kiziltan, Z., Walsh, T.: Combining symmetry breaking with other constraints: lexicographic ordering with sums. In: Proceedings of the 8th International Symposium on the Artificial Intelligence and Mathematics (2004)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-03251-6_6","volume-title":"Recent Advances in Constraints","author":"G. Katsirelos","year":"2009","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: Combining symmetry breaking and global constraints. In: Oddi, A., Fages, F., Rossi, F. (eds.) CSCLP 2008. LNCS, vol.\u00a05655, pp. 84\u201398. Springer, Heidelberg (2009)"},{"key":"6_CR22","first-page":"246","volume-title":"Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC 1983)","author":"H. Gabow","year":"1983","unstructured":"Gabow, H., Tarjan, R.: A linear-time algorithm for a special case of disjoint set union. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC 1983), pp. 246\u2013251. ACM, New York (1983)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21311-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:05:07Z","timestamp":1609203907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21311-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213106","9783642213113"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21311-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}