{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:54:38Z","timestamp":1725465278289},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642381706"},{"type":"electronic","value":"9783642381713"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38171-3_27","type":"book-chapter","created":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T01:30:36Z","timestamp":1365643836000},"page":"362-368","source":"Crossref","is-referenced-by-count":0,"title":["Tight LP-Relaxations of Overlapping Global Cardinality Constraints"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Mourtos","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-29828-8_4","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"D. Bergman","year":"2012","unstructured":"Bergman, D., Hooker, J.N.: Graph Coloring Facets from All-Different Systems. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol.\u00a07298, pp. 50\u201365. Springer, Heidelberg (2012)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1145\/1810891.1810914","volume":"53","author":"A.A. Bulatov","year":"2010","unstructured":"Bulatov, A.A., Marx, D.: Constraint Satisfaction Problems and Global Cardinality Constraints. Communications of the ACM\u00a053, 99\u2013106 (2010)","journal-title":"Communications of the ACM"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Hooker, J.N.: Integrated Methods for Optimization. International Series in Operations Research & Management Science. Springer (2012)","DOI":"10.1007\/978-1-4614-1900-6"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10601-005-2237-y","volume":"10","author":"I. Katriel","year":"2005","unstructured":"Katriel, I., Thiel, S.: Complete Bound Consistency for the Global Cardinality Constraint. Constraints\u00a010, 191\u2013217 (2005)","journal-title":"Constraints"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1137\/090780298","volume":"25","author":"D. Magos","year":"2011","unstructured":"Magos, D., Mourtos, I.: On the facial structure of the AllDifferent system. SIAM Journal on Discrete Mathematics\u00a025, 130\u2013158 (2011)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10601-005-0552-y","volume":"10","author":"C.G. Quimper","year":"2005","unstructured":"Quimper, C.G., Golynski, A., L\u00f3pez-Ortiz, A., van Beek, P.: An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. Constraints\u00a010, 115\u2013135 (2005)","journal-title":"Constraints"},{"key":"27_CR7","unstructured":"Regin, J.C.: Generalized arc consistency for global cardinality constrain. In: Proceedings of AAAI 1996, pp. 209\u2013215 (1996)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1020506526052","volume":"7","author":"J.C. Regin","year":"2002","unstructured":"Regin, J.C.: Cost-Based Arc Consistency for Global Cardinality Constraints. Constraints\u00a07, 387\u2013405 (2002)","journal-title":"Constraints"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-009-9079-y","volume":"16","author":"M. Samer","year":"2011","unstructured":"Samer, M., Szeider, S.: Tractable cases of the extended global cardinality constraint. Constraints\u00a016, 1\u201324 (2011)","journal-title":"Constraints"},{"key":"27_CR10","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)"}],"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-38171-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:07:58Z","timestamp":1609204078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38171-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381706","9783642381713"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38171-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}