{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:02:26Z","timestamp":1742947346811,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_19","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T08:47:22Z","timestamp":1304585242000},"page":"196-209","source":"Crossref","is-referenced-by-count":3,"title":["Almost Square Packing"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Simonis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"19_CR1","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 problems. Journal of Mathematical and Computer Modelling\u00a017(7), 57\u201373 (1993)","journal-title":"Journal of Mathematical and Computer Modelling"},{"key":"19_CR2","unstructured":"Beldiceanu, N., Bourreau, E., Simonis, H.: A note on perfect square placement, Prob009 in CSPLIB (1999)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M.: Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh [20], pp. 377\u2013391.","DOI":"10.1007\/3-540-45578-7_26"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., Poder, E.: New filtering for the cumulative constraint in the context of non-overlapping. In: CP-AI-OR 2008, Paris (May 2008)","DOI":"10.1007\/978-3-540-68155-7_5"},{"key":"19_CR5","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":"12","key":"19_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling\u00a020(12), 97\u2013123 (1994)","journal-title":"Journal of Mathematical and Computer Modelling"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Guo, Q., Thiel, S.: Non-overlapping constraints between convex polytopes. In: Walsh [20], pp. 392\u2013407","DOI":"10.1007\/3-540-45578-7_27"},{"key":"19_CR8","unstructured":"Huang, E., Korf, R.E.: New improvements in optimal rectangle packing. In: Boutilier, C. (ed.) IJCAI, pp. 511\u2013516 (2009)"},{"key":"19_CR9","volume-title":"AAAI","author":"E. Huang","year":"2010","unstructured":"Huang, E., Korf, R.E.: Optimal rectangle packing on non-square benchmarks. In: Fox, M., Poole, D. (eds.) AAAI. AAAI Press, Menlo Park (2010)"},{"key":"19_CR10","first-page":"287","volume-title":"ICAPS","author":"R.E. Korf","year":"2003","unstructured":"Korf, R.E.: Optimal rectangle packing: Initial results. In: Giunchiglia, E., Muscettola, N., Nau, D.S. (eds.) ICAPS, pp. 287\u2013295. AAAI, Menlo Park (2003)"},{"key":"19_CR11","first-page":"142","volume-title":"ICAPS","author":"R.E. Korf","year":"2004","unstructured":"Korf, R.E.: Optimal rectangle packing: New results. In: Zilberstein, S., Koehler, J., Koenig, S. (eds.) ICAPS, pp. 142\u2013149. AAAI, Menlo Park (2004)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10479-008-0463-6","volume":"179","author":"R. Korf","year":"2010","unstructured":"Korf, R., Moffitt, M., Pollack, M.: Optimal rectangle packing. Annals of Operations Research\u00a0179, 261\u2013295 (2010), 10.1007\/s10479-008-0463-6","journal-title":"Annals of Operations Research"},{"key":"19_CR13","unstructured":"MacHale, D.: The almost square problem. Personal Communication (2008)"},{"key":"19_CR14","first-page":"1103","volume-title":"DAC","author":"M.D. Moffitt","year":"2006","unstructured":"Moffitt, M.D., Ng, A.N., Markov, I.L., Pollack, M.E.: Constraint-driven floorplan repair. In: Sentovich, E. (ed.) DAC, pp. 1103\u20131108. ACM, New York (2006)"},{"key":"19_CR15","first-page":"93","volume-title":"ICAPS","author":"M.D. Moffitt","year":"2006","unstructured":"Moffitt, M.D., Pollack, M.E.: Optimal rectangle packing: A meta-CSP approach. In: Long, D., Smith, S.F., Borrajo, D., McCluskey, L. (eds.) ICAPS, pp. 93\u2013102. AAAI, Menlo Park (2006)"},{"key":"19_CR16","first-page":"147","volume-title":"ASP-DAC","author":"J.A. Roy","year":"2007","unstructured":"Roy, J.A., Markov, I.L.: Eco-system: Embracing the change in placement. In: ASP-DAC, pp. 147\u2013152. IEEE, Los Alamitos (2007)"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-642-15396-9_37","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"H. Simonis","year":"2010","unstructured":"Simonis, H., Davern, P., Feldman, J., Mehta, D., Quesada, L., Carlsson, M.: A generic visualization platform for CP. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 460\u2013474. Springer, Heidelberg (2010)"},{"key":"19_CR18","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)"},{"key":"19_CR19","volume-title":"Intelligent Scheduling","author":"P. Van Hentenryck","year":"1994","unstructured":"Van Hentenryck, P.: Scheduling and packing in the constraint language cc(FD). In: Zweben, M., Fox, M. (eds.) Intelligent Scheduling. Morgan Kaufmann Publishers, San Francisco (1994)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP 2001","year":"2001","unstructured":"Walsh, T. (ed.): CP 2001. LNCS, vol.\u00a02239. 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-21311-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:04:19Z","timestamp":1609203859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21311-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213106","9783642213113"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21311-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}