{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:16:04Z","timestamp":1742922964024,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202028"},{"type":"electronic","value":"9783540451938"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45193-8_41","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T23:35:03Z","timestamp":1283988903000},"page":"600-614","source":"Crossref","is-referenced-by-count":18,"title":["An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint"],"prefix":"10.1007","author":[{"given":"Claude-Guy","family":"Quimper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"van Beek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Golynski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sayyed Bashir","family":"Sadjad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Caseau, Y., Guillo, P.-Y., Levenez, E.: A deductive and object-oriented approach to a complex scheduling problem. In: Deductive and Object-Oriented Databases, pp. 67\u201380 (1993)","DOI":"10.1007\/3-540-57530-8_5"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. In: STOC 1983, pp. 246\u2013251 (1983)","DOI":"10.1145\/800061.808753"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Hall, P.: On representatives of subsets. J. of the London Mathematical Society, 26\u201330 (1935)","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"41_CR4","unstructured":"Ilog, S. A.: ILOG Solver 4.2 user\u2019s manual (1998)"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-540-45193-8_30","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"I. Katriel","year":"2003","unstructured":"Katriel, I., Thiel, S.: Fast bound consistency for the global cardinality constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 437\u2013451. Springer, Heidelberg (2003)"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF00264533","volume":"15","author":"W. Lipski","year":"1981","unstructured":"Lipski, W., Preparata, F.P.: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Informatica\u00a015, 329\u2013346 (1981)","journal-title":"Acta Informatica"},{"key":"41_CR7","unstructured":"L\u00f3pez-Ortiz, C.-G., Quimper, J.T., van Beek, P.: A fast and simple algorithm for bounds consistency of the alldifferent constraint. In: IJCAI 2003 (2003)"},{"key":"41_CR8","unstructured":"Puget, J.-F.: A fast algorithm for the bound consistency of alldiff constraints. In: AAAI 1998, pp. 359\u2013366 (1998)"},{"key":"41_CR9","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: AAAI 1994, pp. 362\u2013367 (1994)"},{"key":"41_CR10","unstructured":"R\u00e9gin, J.-C.: Generalized arc consistency for global cardinality constraint. In: AAAI 1996, pp. 209\u2013215 (1996)"},{"key":"41_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0017428","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"J.-C. R\u00e9gin","year":"1997","unstructured":"R\u00e9gin, J.-C., Puget, J.-F.: A filtering algorithm for global sequencing constraints. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 32\u201346. Springer, Heidelberg (1997)"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Schulte, C., Stuckey, P.J.: When do bounds and domain propagation lead to the same search space. In: PPDP 2001, pp. 115\u2013126 (2001)","DOI":"10.1145\/773184.773197"},{"key":"41_CR13","unstructured":"Stergiou, K., Walsh, T.: The difference all-difference makes. In: IJCAI 1999, pp. 414\u2013419 (1999)"},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/3-540-45578-7_52","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"P. van Beek","year":"2001","unstructured":"van Beek, P., Wilken, K.: Fast optimal instruction scheduling for single-issue processors with arbitrary latencies. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 625\u2013639. Springer, Heidelberg (2001)"},{"key":"41_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/10704567_6","volume-title":"Principles and Practice of Declarative Programming","author":"P. Van Hentenryck","year":"1999","unstructured":"Van Hentenryck, P., Michel, L., Perron, L., R\u00e9gin, J.-C.: Constraint programming in OPL. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 98\u2013116. Springer, Heidelberg (1999)"},{"key":"41_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","volume":"58","author":"P. Van Hentenryck","year":"1992","unstructured":"Van Hentenryck, P., Simonis, H., Dincbas, M.: Constraint satisfaction using constraint logic programming. Artificial Intelligence\u00a058, 113\u2013159 (1992)","journal-title":"Artificial Intelligence"},{"key":"41_CR17","unstructured":"van Hoeve, W.J.: The alldifferent constraint: A survey (2001) unpublished manuscript"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2003"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45193-8_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T03:29:51Z","timestamp":1676690991000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-45193-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202028","9783540451938"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45193-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}