{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T19:33:11Z","timestamp":1768159991102,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,2,23]],"date-time":"2012-02-23T00:00:00Z","timestamp":1329955200000},"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":[[2012,7]]},"DOI":"10.1007\/s10479-012-1084-7","type":"journal-article","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T11:27:37Z","timestamp":1329910057000},"page":"53-71","source":"Crossref","is-referenced-by-count":14,"title":["A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint"],"prefix":"10.1007","volume":"196","author":[{"given":"Andreas","family":"Bortfeldt","sequence":"first","affiliation":[]},{"given":"Sabine","family":"Jungmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,23]]},"reference":[{"key":"1084_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.ejor.2010.09.023","volume":"209","author":"S. D. Allen","year":"2011","unstructured":"Allen, S. D., Burke, E. K., & Kendall, G. (2011). A hybrid placement strategy for the three-dimensional strip packing problem. European Journal of Operational Research, 209, 219\u2013227.","journal-title":"European Journal of Operational Research"},{"key":"1084_CR2","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","volume":"35","author":"R. Alvarez-Valdes","year":"2008","unstructured":"Alvarez-Valdes, R., Parreno, F., & Tamarit, J. M. (2008). Reactive GRASP for the strip-packing problem. Computers and Operations Research, 35, 1065\u20131083.","journal-title":"Computers and Operations Research"},{"key":"1084_CR3","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B. S. Baker","year":"1980","unstructured":"Baker, B. S., Coffmann, E. G., & Rivest, R. L. (1980). Orthogonal packings in two dimensions. SIAM Journal on Computing, 9, 846\u2013855.","journal-title":"SIAM Journal on Computing"},{"key":"1084_CR4","doi-asserted-by":"crossref","DOI":"10.1155\/2009\/732010","volume":"2009","author":"A. Bekrar","year":"2009","unstructured":"Bekrar, A., & Kacem, I. (2009). An exact method for the 2D guillotine strip packing problem. Advances in Operations Research, 2009, 732010.","journal-title":"Advances in Operations Research"},{"key":"1084_CR5","first-page":"151","volume":"1","author":"A. Bekrar","year":"2007","unstructured":"Bekrar, A., Kacem, I., & Chu, C. (2007). A comparative study of exact algorithms for the two dimensional strip packing problem. Journal of Industrial and Systems Engineering, 1, 151\u2013170.","journal-title":"Journal of Industrial and Systems Engineering"},{"key":"1084_CR6","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1057\/palgrave.jors.2602393","volume":"59","author":"G. Belov","year":"2008","unstructured":"Belov, G., Scheithauer, G., & Mukhacheva, E. A. (2008). One-dimensional heuristics adapted for two-dimensional rectangular strip packing. The Journal of the Operational Research Society, 59, 823\u2013832.","journal-title":"The Journal of the Operational Research Society"},{"key":"1084_CR7","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"J. O. Berkey","year":"1987","unstructured":"Berkey, J. O., & Wang, P. Y. (1987). Two dimensional finite bin packing algorithms. The Journal of the Operational Research Society, 38, 423\u2013429.","journal-title":"The Journal of the Operational Research Society"},{"key":"1084_CR8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0377-2217(90)90362-F","volume":"44","author":"E. E. Bischoff","year":"1990","unstructured":"Bischoff, E. E., & Mariott, M. D. (1990). A comparative evaluation of heuristics for container loading. European Journal of Operational Research, 44, 267\u2013276.","journal-title":"European Journal of Operational Research"},{"key":"1084_CR9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","volume":"23","author":"E. E. Bischoff","year":"1995","unstructured":"Bischoff, E. E., & Ratcliff, M. S. W. (1995). Issues in the development of approaches to container loading. Omega, 23, 377\u2013390.","journal-title":"Omega"},{"key":"1084_CR10","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.ejor.2004.11.016","volume":"172","author":"A. Bortfeldt","year":"2006","unstructured":"Bortfeldt, A. (2006). A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. European Journal of Operational Research, 172, 814\u2013837.","journal-title":"European Journal of Operational Research"},{"key":"1084_CR11","first-page":"1153","volume-title":"Proceedings of the fifth international conference of the decision sciences institute","author":"A. Bortfeldt","year":"1999","unstructured":"Bortfeldt, A., & Gehring, H. (1999). Two metaheuristics for strip packing problems. In D. K. Despotis & C.\u00a0Zopounidis (Eds.), Proceedings of the fifth international conference of the decision sciences institute, Athens 1999 (Vol.\u00a02, pp.\u00a01153\u20131156)."},{"key":"1084_CR12","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1016\/j.ejor.2005.07.031","volume":"183","author":"A. Bortfeldt","year":"2007","unstructured":"Bortfeldt, A., & Mack, D. (2007). A heuristic for the three-dimensional strip packing problem. European Journal of Operational Research, 183, 1267\u20131279.","journal-title":"European Journal of Operational Research"},{"key":"1084_CR13","first-page":"655","volume":"52","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., Kendall, G., & Whitwell, G. (2004). A new placement heuristic for the orthogonal stock-cutting problem. INFORMS Journal on Computing, 52, 655\u2013671.","journal-title":"INFORMS Journal on Computing"},{"key":"1084_CR14","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1287\/ijoc.1080.0306","volume":"21","author":"E. K. Burke","year":"2009","unstructured":"Burke, E. K., Kendall, G., & Whitwell, G. (2009). A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock cutting problem. INFORMS Journal on Computing, 21, 505\u2013516.","journal-title":"INFORMS Journal on Computing"},{"key":"1084_CR15","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1016\/j.cor.2006.08.011","volume":"35","author":"Y. Cui","year":"2008","unstructured":"Cui, Y., Yang, Y., Cheng, X., & Song, P. (2008). A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem. Computers & Operations Research, 35, 1281\u20131291.","journal-title":"Computers & Operations Research"},{"key":"1084_CR16","unstructured":"Davies, A. P., & Bischoff, E. E. (1998). Weight distribution considerations in container loading (Technical Report). European Business Management School, University of Wales, Swansea, Statistics and OR Group."},{"key":"1084_CR17","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1287\/ijoc.1090.0338","volume":"22","author":"T. Fanslau","year":"2010","unstructured":"Fanslau, T., & Bortfeldt, A. (2010). A tree search algorithm for solving the container loading problem. INFORMS Journal on Computing, 22, 222\u2013235.","journal-title":"INFORMS Journal on Computing"},{"key":"1084_CR18","unstructured":"Fekete, S. P., & Schepers, J. (1997). On more-dimensional packing III: Exact algorithms (Technical Report ZPR97-290). Mathematisches Institut, Universit\u00e4t zu K\u00f6ln."},{"key":"1084_CR19","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"S. P. Fekete","year":"2007","unstructured":"Fekete, S. P., Schepers, J., & van\u00a0der Veen, J. C. (2007). An exact algorithm for higherdimensional orthogonal packing. Operations Research, 55, 569\u2013587.","journal-title":"Operations Research"},{"key":"1084_CR20","unstructured":"Hopper, E. (2000). Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. Ph.D. Thesis, University of Wales."},{"key":"1084_CR21","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E. Hopper","year":"2000","unstructured":"Hopper, E., & Turton, B. C. H. (2000). An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research, 128, 34\u201357.","journal-title":"European Journal of Operational Research"},{"key":"1084_CR22","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1012590107280","volume":"16","author":"E. Hopper","year":"2001","unstructured":"Hopper, E., & Turton, B. C. H. (2001). A review of the application of meta-heuristic algorithms to 2D strip packing problems. Artificial Intelligence Review, 16, 257\u2013300.","journal-title":"Artificial Intelligence Review"},{"key":"1084_CR23","volume-title":"Optimization and industry: new frontieres","author":"M. Iori","year":"2002","unstructured":"Iori, M., Martello, S., & Monaci, M. (2002). Metaheuristic algorithms for the strip packing problem. In P.\u00a0Pardalos & V.\u00a0Korotkich (Eds.), Optimization and industry: new frontieres. Norwell: Kluwer Academic."},{"key":"1084_CR24","first-page":"441","volume-title":"Lecture notes in computer science","author":"K. Karabulut","year":"2004","unstructured":"Karabulut, K., & Inceoglu, M. M. (2004). A hybrid genetic algorithm for packing in 3D with deepest bottom left with fill method. In Lecture notes in computer science (Vol.\u00a03261, pp.\u00a0441\u2013450). Berlin: Springer."},{"key":"1084_CR25","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2008.08.020","volume":"198","author":"M. Kenmochi","year":"2009","unstructured":"Kenmochi, M., Imamichi, T., Nonobe, K., Yagiura, M., & Nagamochi, H. (2009). Exact algorithms for the 2-dimensional strip packing problem with and without rotations. European Journal of Operational Research, 198, 73\u201383.","journal-title":"European Journal of Operational Research"},{"key":"1084_CR26","unstructured":"Kr\u00f6ger, B. (1993). Parallele genetische Algorithmen zur L\u00f6sung eines zweidimensionalen Bin Packing Problems. Ph.D. Thesis, Fachbereich Mathematik and Informatik, Universit\u00e4t Osnabr\u00fcck."},{"key":"1084_CR27","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/0377-2217(95)00029-P","volume":"84","author":"B. Kr\u00f6ger","year":"1995","unstructured":"Kr\u00f6ger, B. (1995). Guillotine bin packing: A\u00a0genetic approach. European Journal of Operational Research, 84, 645\u2013661.","journal-title":"European Journal of Operational Research"},{"key":"1084_CR28","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.ipl.2004.01.006","volume":"90","author":"N. Lesh","year":"2004","unstructured":"Lesh, N., Marks, J., McMahon, A., & Mitzenmacher, M. (2004). Exhaustive approaches to 2D rectangular perfect packings. Information Processing Letters, 90, 7\u201314.","journal-title":"Information Processing Letters"},{"key":"1084_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1064546.1083322","volume":"10","author":"N. Lesh","year":"2005","unstructured":"Lesh, N., Marks, J., McMahon, A., & Mitzenmacher, M. (2005). New heuristic and interactive approaches to 2D rectangular strip packing. ACM Journal of Experimental Algorithmics, 10, 1\u201318.","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"1084_CR30","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A. Lodi","year":"1999","unstructured":"Lodi, A., Martello, S., & Vigo, D. (1999). Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing, 11, 345\u2013357.","journal-title":"INFORMS Journal on Computing"},{"key":"1084_CR31","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S. Martello","year":"1998","unstructured":"Martello, S., & Vigo, D. (1998). Exact solution of the two-dimensional finite bin packing problem. Management Science, 44, 388\u2013399.","journal-title":"Management Science"},{"key":"1084_CR32","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","volume":"15","author":"S. Martello","year":"2003","unstructured":"Martello, S., Monaci, M., & Vigo, D. (2003). An exact approach to the strip-packing problem. INFORMS Journal on Computing, 15, 310\u2013319.","journal-title":"INFORMS Journal on Computing"},{"key":"1084_CR33","first-page":"501","volume-title":"Metaheuristics: computer decision-making","author":"C. L. Mumford-Valenzuela","year":"2004","unstructured":"Mumford-Valenzuela, C. L., Vick, J., & Wang, P. Y. (2004). Heuristics for large strip packing problems with guillotine patterns: an empirical study. In: Metaheuristics: computer decision-making (pp. 501\u2013522). Norwell: Kluwer Academic."},{"key":"1084_CR34","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.ejor.2009.07.024","volume":"203","author":"F. G. Ortmann","year":"2010","unstructured":"Ortmann, F. G., Nthabiseng, N., & van Vuuren, J. H. (2010). New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems. European Journal of Operational Research, 203, 306\u2013315.","journal-title":"European Journal of Operational Research"},{"key":"1084_CR35","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","volume":"141","author":"D. Pisinger","year":"2002","unstructured":"Pisinger, D. (2002). Heuristics for the container loading problem. European Journal of Operational Research, 141, 382\u2013392.","journal-title":"European Journal of Operational Research"},{"key":"1084_CR36","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1016\/j.engappai.2008.10.025","volume":"22","author":"M. C. Riff","year":"2009","unstructured":"Riff, M. C., Bonnaire, X., & Neveu, B. (2009). A revision of recent approaches for two dimensional strip-packing problems. Engineering Applications of Artificial Intelligence, 22, 823\u2013827.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"1084_CR37","unstructured":"Schnecke, V. (1996). Hybrid genetic algorithms for solving constrained packing and placement problems. Ph.D. Thesis, Fachbereich Mathematik und Informatik, Universit\u00e4t Osnabr\u00fcck."},{"key":"1084_CR38","unstructured":"Sixt, M. (1996). Dreidimensionale Packprobleme. L\u00f6sungsverfahren basierend auf den Metaheuristiken Simulated Annealing und Tabu-Suche. Ph.D. Thesis, Frankfurt am Main, Peter Lang, Europ\u00e4ischer Verlag der Wissenschaften."},{"key":"1084_CR39","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G. W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Haussner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183, 1109\u20131130.","journal-title":"European Journal of Operational Research"},{"key":"1084_CR40","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1016\/j.cor.2008.03.004","volume":"36","author":"L. Wei","year":"2009","unstructured":"Wei, L., Zhang, D., & Chen, Q. (2009). A least wasted first heuristic algorithm for the rectangular packing problem. Computers & Operations Research, 36, 1608\u20131614.","journal-title":"Computers & Operations Research"},{"key":"1084_CR41","first-page":"1235","volume-title":"Lecture notes in computer science, part\u00a0III","author":"D. Zhang","year":"2005","unstructured":"Zhang, D., Liu, Y., Chen, S., & Xie, X. (2005). A meta-heuristic algorithm for the strip rectangular packing problem. In Lecture notes in computer science, part\u00a0III (Vol.\u00a03612, pp. 1235\u20131241). Berlin: Springer."},{"key":"1084_CR42","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1016\/j.cor.2005.01.009","volume":"33","author":"D. Zhang","year":"2006","unstructured":"Zhang, D., Kang, Y., & Deng, A. (2006). A new heuristic recursive algorithm for the strip rectangular packing problem. Computers & Operations Research, 33, 2209\u20132217.","journal-title":"Computers & Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1084-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1084-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1084-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T10:09:32Z","timestamp":1640858972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1084-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,23]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1084"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1084-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,23]]}}}