{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:46:19Z","timestamp":1742942779159,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642019289"},{"type":"electronic","value":"9783642019296"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-01929-6_3","type":"book-chapter","created":{"date-parts":[[2009,5,16]],"date-time":"2009-05-16T09:09:16Z","timestamp":1242464956000},"page":"11-25","source":"Crossref","is-referenced-by-count":4,"title":["Six Ways of Integrating Symmetries within Non-overlapping Constraints"],"prefix":"10.1007","author":[{"given":"Magnus","family":"\u00c5gren","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Beldiceanu","sequence":"additional","affiliation":[]},{"given":"Mats","family":"Carlsson","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Sbihi","sequence":"additional","affiliation":[]},{"given":"Charlotte","family":"Truchet","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Zampelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"83","key":"3_CR1","first-page":"3","volume":"27","author":"G. Scheithauer","year":"1998","unstructured":"Scheithauer, G.: Equivalence and dominance for problems of optimal packing of rectangles. Ricerca Operativa\u00a027(83), 3\u201334 (1998)","journal-title":"Ricerca Operativa"},{"key":"3_CR2","unstructured":"Carlsson, M., Beldiceanu, N.: Arc-consistency for a chain of lexicographic ordering constraints. Technical Report T2002-18, Swedish Institute of Computer Science (2002)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-74970-7_15","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N. Beldiceanu","year":"2007","unstructured":"Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., Truchet, C.: A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 180\u2013194. Springer, Heidelberg (2007)"},{"issue":"7","key":"3_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling\u00a017(7), 57\u201373 (1993)","journal-title":"Mathl. Comput. Modelling"},{"key":"3_CR5","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.-X.: Global constraint catalog. Technical Report T2005-08, Swedish Institute of Computer Science (2005), \n                      http:\/\/www.emn.fr\/x-info\/sdemasse\/gccat\/Clex_between.html"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-45578-7_26","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"N. Beldiceanu","year":"2001","unstructured":"Beldiceanu, N., Carlsson, M.: Sweep as a generic pruning technique applied to the non-overlapping rectangles constraints. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 377\u2013391. Springer, Heidelberg (2001)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"\u00c5gren, M., Beldiceanu, N., Carlsson, M., Sbihi, M., Truchet, C., Zampelli, S.: Six ways of integrating symmetries within non-overlapping constraints. SICS Technical Report T2009:01, Swedish Institute of Computer Science (2009)","DOI":"10.1007\/978-3-642-01929-6_3"},{"key":"3_CR8","first-page":"209","volume":"294","author":"A. Lahrichi","year":"1982","unstructured":"Lahrichi, A.: Scheduling: the notions of hump, compulsory parts and their use in cumulative problems. C.R. Acad. Sci., Paris\u00a0294, 209\u2013211 (1982)","journal-title":"C.R. Acad. Sci., Paris"},{"key":"3_CR9","volume-title":"Joint International Conference and Symposium on Logic Programming (JICSLP 1996)","author":"Y. Caseau","year":"1996","unstructured":"Caseau, Y., Laburthe, F.: Cumulative scheduling with task intervals. In: Joint International Conference and Symposium on Logic Programming (JICSLP 1996). MIT Press, Cambridge (1996)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-85958-1_4","volume-title":"Principles and Practice of Constraint Programming","author":"H. Simonis","year":"2008","unstructured":"Simonis, H., O\u2019Sullivan, B.: Search strategies for rectangle packing. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 52\u201366. Springer, Heidelberg (2008)"}],"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-01929-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T23:04:22Z","timestamp":1609196662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01929-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642019289","9783642019296"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01929-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}