{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T19:34:38Z","timestamp":1777059278033,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T00:00:00Z","timestamp":1629763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T00:00:00Z","timestamp":1629763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10479-021-04226-6","type":"journal-article","created":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T13:06:01Z","timestamp":1629810361000},"page":"79-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A hybrid metaheuristic for the two-dimensional strip packing problem"],"prefix":"10.1007","volume":"309","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5436-0971","authenticated-orcid":false,"given":"St\u00e9phane","family":"Grandcolas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Pain-Barre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,24]]},"reference":[{"issue":"4","key":"4226_CR1","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","volume":"35","author":"R Alvarez-Valdes","year":"2008","unstructured":"Alvarez-Valdes, R., Parre\u00f1o, F., & Tamarit, J. (2008). Reactive grasp for the strip-packing problem. Computers and Operations Research, 35(4), 1065\u20131083. https:\/\/doi.org\/10.1016\/j.cor.2006.07.004.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"4226_CR2","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B Baker","year":"1980","unstructured":"Baker, B., Coffman, E., & Rivest, R. (1980). Orthogonal packing in two dimensions. SIAM Journal of Computing, 9(4), 846\u2013855.","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"4226_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1057\/jors.1985.51","volume":"36","author":"JE Beasley","year":"1985","unstructured":"Beasley, J. E. (1985). Algorithms for unconstrained two-dimensional guillotine cutting. The Journal of the Operational Research Society, 36(4), 297\u2013306.","journal-title":"The Journal of the Operational Research Society"},{"key":"4226_CR4","doi-asserted-by":"publisher","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 twodimensional rectangular strip packing. Journal of the Operational Research Society, 59, 823\u2013832.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"4226_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1093\/comjnl\/25.3.353","volume":"25","author":"B Bengtsson","year":"1982","unstructured":"Bengtsson, B. (1982). Packing rectangular pieces\u2014a heuristic approach. The Computer Journal, 25(3), 353\u2013357.","journal-title":"The Computer Journal"},{"issue":"5","key":"4226_CR6","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"JO Berkey","year":"1987","unstructured":"Berkey, J. O., & Wang, P. Y. (1987). Two-dimensional finite bin-packing algorithms. Journal of the Operational Research Society, 38(5), 423\u2013429. https:\/\/doi.org\/10.1057\/jors.1987.70","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"4226_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(95)00057-4","volume":"148","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H. L., & Jansen, K. (1995). Restrictions of graph partition problems. part i. Theoretical Computer Science, 148(1), 93\u2013109. https:\/\/doi.org\/10.1016\/0304-3975(95)00057-4","journal-title":"Theoretical Computer Science"},{"key":"4226_CR8","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1287\/opre.1100.0833","volume":"58","author":"MA Boschetti","year":"2010","unstructured":"Boschetti, M. A., & Montaletti, L. (2010). An exact algorithm for the two-dimensional strip-packing problem. Operational Research, 58, 1774\u20131791.","journal-title":"Operational Research"},{"issue":"4","key":"4226_CR9","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"EK Burke","year":"2004","unstructured":"Burke, E. K., Kendall, G., & Whitwell, G. (2004). A new placement heuristic for the orthogonal stock-cutting problem. Operational Research, 52(4), 655\u2013671. https:\/\/doi.org\/10.1287\/opre.1040.0109","journal-title":"Operational Research"},{"issue":"8","key":"4226_CR10","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1109\/TC.1983.1676307","volume":"32","author":"B Chazelle","year":"1983","unstructured":"Chazelle, B. (1983). The bottom-left bin-packing heuristic: An efficient implementation. IEEE Transactions on Computers, 32(8), 697\u2013707.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"4226_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N Christofides","year":"1977","unstructured":"Christofides, N., & Whitlock, C. (1977). An algorithm for two-dimensional cutting problems. Operations Research, 25(1), 30\u201344. https:\/\/doi.org\/10.1287\/opre.25.1.30","journal-title":"Operations Research"},{"issue":"3","key":"4226_CR12","doi-asserted-by":"publisher","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":"4226_CR13","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/opre.2013.1248","volume":"62","author":"JF C\u00f4t\u00e8","year":"2014","unstructured":"C\u00f4t\u00e8, J. F., Dell\u2018Amico, M., & Iori, M. (2014). Combinatorial benders\u2018 cuts for the strip packing problem. Operations Research, 62(3), 643\u2013661.","journal-title":"Operations Research"},{"issue":"2","key":"4226_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10951-008-0089-1","volume":"12","author":"G Even","year":"2009","unstructured":"Even, G., Halld\u00f3rsson, M. M., Kaplan, L., & Ron, D. (2009). Scheduling with conflicts: Online and offline algorithms. Journal of Scheduling, 12(2), 199\u2013224. https:\/\/doi.org\/10.1007\/s10951-008-0089-1","journal-title":"Journal of Scheduling"},{"issue":"2","key":"4226_CR15","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1287\/moor.1030.0079","volume":"29","author":"SP Fekete","year":"2004","unstructured":"Fekete, S. P., & Schepers, J. (2004). A combinatorial characterization of higher-dimensional orthogonal packing. Mathematics of Operations Research, 29(2), 353\u2013368.","journal-title":"Mathematics of Operations Research"},{"key":"4226_CR16","unstructured":"Garey, M. R., & Johnson, D. S. (1979). In W. H. Freeman & Co., (Eds.), Computers and Intractability. New York, NY, USA: A Guide to the Theory of NP-Completeness."},{"issue":"3","key":"4226_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10852-015-9278-z","volume":"14","author":"S Grandcolas","year":"2015","unstructured":"Grandcolas, S., & Pinto, C. (2015). A new search procedure for the two-dimensional orthogonal packing problem. Jounal of Mathematical Modelling Algorithms in OR, 14(3), 343\u2013361. https:\/\/doi.org\/10.1007\/s10852-015-9278-z","journal-title":"Jounal of Mathematical Modelling Algorithms in OR"},{"key":"4226_CR18","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-1-4613-0233-9_7","volume-title":"Optimization and industry: New Frontiers, chap. Metaheuristic algorithms for the strip packing problem","author":"M Iori","year":"2003","unstructured":"Iori, M., Martello, S., & Monaci, M. (2003). Optimization and industry: New Frontiers, chap. Metaheuristic algorithms for the strip packing problem (pp. 159\u2013179). US, Boston, MA: Springer. https:\/\/doi.org\/10.1007\/978-1-4613-0233-9_7"},{"key":"4226_CR19","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. (2010). Optimal rectangle packing. Annals of Operations Research, 179, 261\u2013295. https:\/\/doi.org\/10.1007\/s10479-008-0463-6","journal-title":"Annals of Operations Research"},{"key":"4226_CR20","doi-asserted-by":"publisher","DOI":"10.1145\/1064546.1083322","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. Journal of Experimental Algorithmics. https:\/\/doi.org\/10.1145\/1064546.1083322","journal-title":"Journal of Experimental Algorithmics"},{"issue":"1","key":"4226_CR21","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2011.06.002","volume":"215","author":"SCH Leung","year":"2011","unstructured":"Leung, S. C. H., Zhang, D., & Sim, K. M. (2011). A two-stage intelligent search algorithm for the two-dimensional strip packing problem. European Journal of Operational Research, 215(1), 57\u201369. https:\/\/doi.org\/10.1016\/j.ejor.2011.06.002","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"4226_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2), 241\u2013252.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"4226_CR23","first-page":"310","volume":"15","author":"S Martello","year":"2003","unstructured":"Martello, S., Monaci, M., & Vigo, D. (2003). An exact approach to the strip-packing problem. Journal on Computing, 15(3), 310\u2013319.","journal-title":"Journal on Computing"},{"key":"4226_CR24","doi-asserted-by":"crossref","unstructured":"Martello, S., Vigo, D. (1998) Exact solution of the two-dimensional finite bin packing problem. Management Science 44(3), 388\u2013399 . http:\/\/www.jstor.org\/stable\/2634676","DOI":"10.1287\/mnsc.44.3.388"},{"issue":"5","key":"4226_CR25","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1142\/S0218213008004205","volume":"17","author":"B Neveu","year":"2008","unstructured":"Neveu, B., Trombettoni, G., Araya, I., & Riff, M. (2008). A strip packing solving method using an incremental move based on maximal holes. International Journal on Artificial Intelligence Tools, 17(5), 881\u2013901. https:\/\/doi.org\/10.1142\/S0218213008004205","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"4226_CR26","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cor.2016.11.024","volume":"80","author":"L Wei","year":"2017","unstructured":"Wei, L., Hu, Q., Leung, S. C., & Zhang, N. (2017). An improved skyline based heuristic for the 2d strip packing problem and its efficient implementation. Computers and Operations Research, 80, 113\u2013127. https:\/\/doi.org\/10.1016\/j.cor.2016.11.024.","journal-title":"Computers and Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04226-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04226-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04226-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T16:33:25Z","timestamp":1642437205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04226-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,24]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["4226"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04226-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,24]]},"assertion":[{"value":"6 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}