{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T18:25:41Z","timestamp":1781375141631,"version":"3.54.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10479-008-0463-6","type":"journal-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T15:38:32Z","timestamp":1225985912000},"page":"261-295","source":"Crossref","is-referenced-by-count":44,"title":["Optimal rectangle packing"],"prefix":"10.1007","volume":"179","author":[{"given":"Richard E.","family":"Korf","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael D.","family":"Moffitt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martha E.","family":"Pollack","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"463_CR1","unstructured":"Armando, A., Castellini, C., & Giunchiglia, E. (1999). SAT-based procedures for temporal reasoning. In Proceedings of the 5th European conference on planning (ECP-1999) (pp. 97\u2013108)."},{"key":"463_CR2","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., & Carlsson, M. (2001). Sweep as a generic pruning technique applied to the non-overlapping rectangles constraints. In Proceedings of the principles and practice of constraint programming (CP\u00a02001) (pp.\u00a0377\u2013391).","DOI":"10.1007\/3-540-45578-7_26"},{"key":"463_CR3","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., & Truchet, C. (2007). A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In Proceedings of the principles and practice of constraint programming (CP 2007) (pp. 180\u2013194).","DOI":"10.1007\/978-3-540-74970-7_15"},{"issue":"10","key":"463_CR4","doi-asserted-by":"crossref","first-page":"2835","DOI":"10.1016\/j.cor.2005.01.013","volume":"33","author":"N. Beldiceanu","year":"2006","unstructured":"Beldiceanu, N., Carlsson, M., & Thiel, S. (2006). Sweep synchronization as a global propagation mechanism. Computers and Operations Research, 33(10), 2835\u20132851.","journal-title":"Computers and Operations Research"},{"issue":"11","key":"463_CR5","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1145\/361219.361224","volume":"18","author":"J. Bitner","year":"1975","unstructured":"Bitner, J., & Reingold, E. (1975). Backtrack programming techniques. Communications of the ACM, 18(11), 655.","journal-title":"Communications of the ACM"},{"key":"463_CR6","unstructured":"Chan, H., & Markov, I. L. (2003). Symmetries in rectangular block-packing. In Workshop notes of the 3rd international workshop on symmetry in constraint satisfaction problems (SymCon 2003)."},{"key":"463_CR7","doi-asserted-by":"crossref","unstructured":"Chan, H., & Markov, I. (2004). Practical slicing and non-slicing block-packing without simulated annealing. In ACM Great lakes symposium on VLSI (GLSVLSI04) (pp. 282\u2013287).","DOI":"10.1145\/988952.989020"},{"issue":"3","key":"463_CR8","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1016\/j.ejor.2005.12.048","volume":"183","author":"F. Clautiaux","year":"2007","unstructured":"Clautiaux, F., Carlier, J., & Moukrim, A. (2007). A new exact method for the two-dimensional orthogonal packing problem. European Journal of Operational Research, 183(3), 1196\u20131211.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"463_CR9","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.cor.2006.05.012","volume":"35","author":"F. Clautiaux","year":"2008","unstructured":"Clautiaux, F., Jouglet, A., Carlier, J., & Moukrim, A. (2008). A new constraint programming approach for the orthogonal packing problem. Computers and Operations Research, 35(3), 944\u2013959.","journal-title":"Computers and Operations Research"},{"issue":"1-3","key":"463_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49(1-3), 61\u201395.","journal-title":"Artificial Intelligence"},{"key":"463_CR11","doi-asserted-by":"crossref","unstructured":"Dutertre, B., & de Moura, L. M. (2006). A fast linear-arithmetic solver for DPLL(T). In Proceedings of the 18th international conference on computer aided verification (CAV-2006) (pp. 81\u201394).","DOI":"10.1007\/11817963_11"},{"issue":"2","key":"463_CR12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/moor.1030.0079","volume":"29","author":"S. P. Fekete","year":"2004","unstructured":"Fekete, S. P., & Schepers, J. (2004a). A combinatorial characterization of higher-dimensional orthogonal packing. Mathematics of Operations Research, 29(2), 353\u2013368.","journal-title":"Mathematics of Operations Research"},{"key":"463_CR13","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"S. Fekete","year":"2004","unstructured":"Fekete, S., & Schepers, J. (2004b). A general framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research, 60, 311\u2013329.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"3","key":"463_CR14","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"S. Fekete","year":"2007","unstructured":"Fekete, S., Schepers, J., & Ween, J. V. D. (2007). An exact algorithm for higher-dimensional orthogonal packing. Operations Research, 55(3), 569\u2013587.","journal-title":"Operations Research"},{"key":"463_CR15","first-page":"139","volume-title":"Mathematical carnival","author":"M. Gardner","year":"1975","unstructured":"Gardner, M. (1975). The problem of mrs. Perkin\u2019s quilt and other square-packing problems. In Mathematical carnival (pp. 139\u2013149). New York: Alfred A. Knopf."},{"key":"463_CR16","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1038\/scientificamerican1079-18","volume":"241","author":"M. Gardner","year":"1979","unstructured":"Gardner, M. (1979). Mathematical games. Scientific American, 241, 18\u201322.","journal-title":"Scientific American"},{"key":"463_CR17","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman."},{"key":"463_CR18","unstructured":"Gent, I. P., & Smith, B. M. (2000). Symmetry breaking in constraint programming. In Proceedings of the 14th European conference on artificial intelligence (ECAI-2000) (pp. 599\u2013603)."},{"key":"463_CR19","doi-asserted-by":"crossref","unstructured":"Guo, P. N., Cheng, C. K., & Yoshimura, T. (1999). An O-tree representation of non-slicing floorplan and its applications. In Proceedings of the 36th design automation conference (DAC 1999) (pp. 268\u2013273).","DOI":"10.1145\/309847.309928"},{"key":"463_CR20","unstructured":"Khatib, L., Morris, P., Morris, R., & Rossi, F. (2001). Temporal constraint reasoning with preferences. In Proceedings of the 17th international joint conference on artificial intelligence (IJCAI-2001) (pp. 322\u2013327)."},{"key":"463_CR21","first-page":"731","volume-title":"Proceedings of the national conference on artificial intelligence (AAAI-02)","author":"R. Korf","year":"2001","unstructured":"Korf, R. (2001). A new algorithm for optimal bin packing. In Proceedings of the national conference on artificial intelligence (AAAI-02) (pp. 731\u2013736). Edmonton: AAAI Press."},{"key":"463_CR22","first-page":"287","volume-title":"Proceedings of the thirteenth international conference on automated planning and scheduling (ICAPS 2003)","author":"R. Korf","year":"2003","unstructured":"Korf, R. (2003). Optimal rectangle packing: Initial results. In Proceedings of the thirteenth international conference on automated planning and scheduling (ICAPS 2003) (pp. 287\u2013295). Trento: AAAI Press."},{"key":"463_CR23","first-page":"142","volume-title":"Proceedings of the fourteenth international conference on automated planning and scheduling (ICAPS 2004)","author":"R. Korf","year":"2004","unstructured":"Korf, R. (2004). Optimal rectangle packing: New results. In Proceedings of the fourteenth international conference on automated planning and scheduling (ICAPS 2004) (pp. 142\u2013149). Whistler: AAAI Press."},{"key":"463_CR24","doi-asserted-by":"crossref","unstructured":"Liao, Y., & Wong, C. K. (1983). An algorithm to compact a VLSI symbolic layout with mixed constraints. In Proceedings of IEEE transactions on CAD (Vol. 2).","DOI":"10.1109\/DAC.1983.1585634"},{"key":"463_CR25","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"48","author":"S. Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., & Vigo, D. (2000). The three-dimensional bin packing problem. Operations Research, 48, 256\u2013267.","journal-title":"Operations Research"},{"key":"463_CR26","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S. Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics, 28, 59\u201370.","journal-title":"Discrete Applied Mathematics"},{"key":"463_CR27","unstructured":"Moffitt, M. D., Peintner, B., & Pollack, M. E. (2005). Augmenting disjunctive temporal problems with finite-domain constraints. In Proceedings of the 20th national conference on artificial intelligence (AAAI-2005) (pp. 1187\u20131192)."},{"key":"463_CR28","volume-title":"Proceedings of the sixteenth international conference on automated planning and scheduling (ICAPS 2006)","author":"M. Moffitt","year":"2006","unstructured":"Moffitt, M., & Pollack, M. (2006). Optimal rectangle packing: A meta-csp approach. In Proceedings of the sixteenth international conference on automated planning and scheduling (ICAPS 2006). Cumbria: AAAI Press."},{"key":"463_CR29","doi-asserted-by":"crossref","unstructured":"Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th design automation conference (DAC 2001) (pp. 530\u2013535).","DOI":"10.1145\/378239.379017"},{"key":"463_CR30","doi-asserted-by":"crossref","unstructured":"Murata, H., Fujiyoshi, K., Nakatake, S., & Kajitani, Y. (1995). Rectangle-base module placement. In Proceedings of the international conference on computer-aided design (ICCAD95) (pp. 472\u2013479).","DOI":"10.1109\/ICCAD.1995.480159"},{"key":"463_CR31","doi-asserted-by":"crossref","unstructured":"Nakatake, S., Fujiyoshi, K., Murata, H., & Kajitani, Y. (1996). Module placement on bsg-structure and ic layout applications. In Proceedings of the international conference on computer-aided design (ICCAD96) (pp. 484\u2013491).","DOI":"10.1109\/ICCAD.1996.569870"},{"key":"463_CR32","unstructured":"Oddi, A., & Cesta, A. (2000). Incremental forward checking for the disjunctive temporal problem. In Proceedings of the 14th European conference on artificial intelligence (ECAI-2000) (pp. 108\u2013112)."},{"key":"463_CR33","doi-asserted-by":"crossref","unstructured":"Onodera, H., Taniguchi, Y., & Tamaru, K. (1991). Branch-and-bound placement for building-block layout. In Proceedings of the ACM design automation conference (DAC91) (pp. 433\u2013439).","DOI":"10.1145\/127601.127708"},{"key":"463_CR34","first-page":"3","volume":"83","author":"G. Scheithauer","year":"1998","unstructured":"Scheithauer, G. (1998). Equivalence and dominance for problems of optimal packing of rectangles. Ricerca Operativa, 83, 3\u201334.","journal-title":"Ricerca Operativa"},{"key":"463_CR35","doi-asserted-by":"crossref","unstructured":"Sheini, H. M., & Sakallah, K. A. (2006). From propositional satisfiability to satisfiability modulo theories. In Proceedings of the 9th international conference on theory and applications of satisfiability testing (SAT-2006) (pp. 1\u20139).","DOI":"10.1007\/11814948_1"},{"key":"463_CR36","unstructured":"Stergiou, K., & Koubarakis, M. (1998). Backtracking algorithms for disjunctions of temporal constraints. In Proceedings of the 15th national conference on artificial intelligence (AAAI-1998) (pp. 248\u2013253)."},{"issue":"1-2","key":"463_CR37","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(03)00113-9","volume":"151","author":"I. Tsamardinos","year":"2003","unstructured":"Tsamardinos, I., & Pollack, M. E. (2003). Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence, 151(1-2), 43\u201390.","journal-title":"Artificial Intelligence"},{"key":"463_CR38","first-page":"1","volume":"48","author":"G. Watson","year":"1918","unstructured":"Watson, G. (1918). The problem of the square pyramid. Messenger of Mathematics, New Series, 48, 1\u201322.","journal-title":"Messenger of Mathematics, New Series"},{"key":"463_CR39","doi-asserted-by":"crossref","unstructured":"Young, E. F. Y., Chu, C. C. N., & Ho, M. L. (2002). A unified method to handle different kinds of placement constraints in floorplan design. In 15th international conference on VLSI design (VLSI design 2002) (pp. 661\u2013667).","DOI":"10.1109\/ASPDAC.2002.995011"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0463-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0463-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0463-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:51Z","timestamp":1559153271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0463-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,7]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["463"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0463-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,7]]}}}