{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:30:57Z","timestamp":1760833857123,"version":"build-2065373602"},"reference-count":49,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T00:00:00Z","timestamp":1758240000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.cor.2025.107276","type":"journal-article","created":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T21:08:12Z","timestamp":1759007292000},"page":"107276","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Solving the strip packing problem with a decomposition framework and a generic solver: Implementation, tuning, and reinforcement-learning-based hybridization"],"prefix":"10.1016","volume":"185","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2525-7108","authenticated-orcid":false,"given":"Fatih Burak","family":"Ak\u00e7ay","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3730-0894","authenticated-orcid":false,"given":"Maxence","family":"Delorme","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2025.107276_b1","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/j.ejor.2024.09.013","article-title":"Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies","volume":"323","author":"Ak\u00e7ay","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b2","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","article-title":"Reactive GRASP for the strip-packing problem","volume":"35","author":"Alvarez-Vald\u00e9s","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s00291-008-0128-5","article-title":"A branch and bound algorithm for the strip packing problem","volume":"31","author":"Alvarez-Vald\u00e9s","year":"2009","journal-title":"OR Spectrum"},{"key":"10.1016\/j.cor.2025.107276_b4","doi-asserted-by":"crossref","first-page":"2991","DOI":"10.1016\/j.cor.2012.03.003","article-title":"An exact strip packing algorithm based on canonical forms","volume":"39","author":"Arahori","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","article-title":"An exact two-dimensional non-guillotine cutting tree search procedure","author":"Beasley","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b6","first-page":"151","article-title":"A comparative study of exact algorithms for the two dimensional strip packing problem","author":"Bekrar","year":"2007","journal-title":"J. Ind. Syst. Eng."},{"key":"10.1016\/j.cor.2025.107276_b7","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","article-title":"Machine learning for combinatorial optimization: a methodological tour d\u2019horizon","volume":"290","author":"Bengio","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b8","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","article-title":"Two-dimensional finite bin-packing algorithms","volume":"38","author":"Berkey","year":"1987","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.cor.2025.107276_b9","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1080\/01605682.2019.1578914","article-title":"Models for the two-dimensional level strip packing problem\u2013a review and a computational evaluation","volume":"71","author":"Bezerra","year":"2020","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.cor.2025.107276_b10","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1287\/opre.1100.0833","article-title":"An exact algorithm for the two-dimensional strip-packing problem","volume":"58","author":"Boschetti","year":"2010","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b11","series-title":"Handbook of Metaheuristics","first-page":"449","article-title":"A classification of hyper-heuristic approaches","author":"Burke","year":"2010"},{"key":"10.1016\/j.cor.2025.107276_b12","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.1040.0109","article-title":"A new placement heuristic for the orthogonal stock-cutting problem","volume":"52","author":"Burke","year":"2004","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.compchemeng.2012.05.002","article-title":"From time representation in scheduling to the solution of strip packing problems","volume":"44","author":"Castro","year":"2012","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/j.cor.2025.107276_b14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ejor.2011.06.001","article-title":"Scheduling inspired models for two-dimensional packing problems","volume":"215","author":"Castro","year":"2011","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b15","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.25.1.30","article-title":"An algorithm for two-dimensional cutting problems","volume":"25","author":"Christofides","year":"1977","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b16","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0245267","article-title":"Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology","volume":"16","author":"Cid-Garcia","year":"2021","journal-title":"PLoS One"},{"key":"10.1016\/j.cor.2025.107276_b17","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1016\/j.ejor.2005.12.048","article-title":"A new exact method for the two-dimensional orthogonal packing problem","volume":"183","author":"Clautiaux","year":"2007","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b18","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.cor.2006.05.012","article-title":"A new constraint programming approach for the orthogonal packing problem","volume":"35","author":"Clautiaux","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b19","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.ejor.2024.11.018","article-title":"Last fifty years of integer linear programming: a focus on recent practical advances","volume":"324","author":"Clautiaux","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b20","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/opre.2013.1248","article-title":"Combinatorial benders\u2019 cuts for the strip packing problem","volume":"62","author":"C\u00f4t\u00e9","year":"2014","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b21","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1287\/opre.2014.1307","article-title":"An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints","volume":"62","author":"C\u00f4t\u00e9","year":"2014","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b22","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1287\/ijoc.2020.1014","article-title":"Combinatorial benders\u2019 decomposition for the two-dimensional bin packing problem","volume":"33","author":"C\u00f4t\u00e9","year":"2021","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2025.107276_b23","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.ijpe.2013.04.032","article-title":"Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints","author":"de Queiroz","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.cor.2025.107276_b24","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.cor.2016.09.009","article-title":"Logic based benders\u2019 decomposition for orthogonal stock cutting problems","volume":"78","author":"Delorme","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2024.103039","article-title":"Exact decomposition approaches for a single container loading problem with stacking constraints and medium-sized weakly heterogeneous items","volume":"125","author":"Delorme","year":"2024","journal-title":"Omega"},{"key":"10.1016\/j.cor.2025.107276_b26","doi-asserted-by":"crossref","first-page":"3649","DOI":"10.1007\/s00453-023-01152-w","article-title":"Peak demand minimization via sliced strip packing","author":"Deppert","year":"2023","journal-title":"Algorithmica"},{"year":"2024","author":"Gurobi optimization","series-title":"Gurobi online documentation","key":"10.1016\/j.cor.2025.107276_b27"},{"year":"2024","author":"IBM CPLEX optimization","series-title":"CPLEX online documentation","key":"10.1016\/j.cor.2025.107276_b28"},{"year":"2025","author":"IBM CPLEX optimization","series-title":"CPLEX callback capabilities and limitations","key":"10.1016\/j.cor.2025.107276_b29"},{"key":"10.1016\/j.cor.2025.107276_b30","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2008.08.020","article-title":"Exact algorithms for the two-dimensional strip packing problem with and without rotations","volume":"198","author":"Kenmochi","year":"2009","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b31","series-title":"Data Mining and Constraint Programming: Foundations of a Cross-Disciplinary Approach","first-page":"149","article-title":"Algorithm selection for combinatorial search problems: A survey","author":"Kotthoff","year":"2016"},{"unstructured":"Lagoudakis, M., Littman, M., 2000. Algorithm Selection using Reinforcement Learning. In: ICML. pp. 511\u2013518.","key":"10.1016\/j.cor.2025.107276_b32"},{"key":"10.1016\/j.cor.2025.107276_b33","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ejor.2011.06.002","article-title":"A two-stage intelligent search algorithm for the two-dimensional strip packing problem","volume":"215","author":"Leung","year":"2011","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b34","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.ejor.2023.12.008","article-title":"Instance space analysis for 2D bin packing mathematical models","volume":"315","author":"Liu","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b35","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","article-title":"An exact approach to the strip-packing problem","volume":"15","author":"Martello","year":"2003","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2025.107276_b36","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","article-title":"Exact solution of the two-dimensional finite bin packing problem","volume":"44","author":"Martello","year":"1998","journal-title":"Manag. Sci."},{"key":"10.1016\/j.cor.2025.107276_b37","doi-asserted-by":"crossref","first-page":"1854","DOI":"10.1080\/00207543.2021.1876270","article-title":"Two-stage and one-group two-dimensional guillotine cutting problems with defects: a CP-based algorithm and ILP formulations","volume":"60","author":"Martin","year":"2022","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2025.107276_b38","doi-asserted-by":"crossref","DOI":"10.1299\/jamdsm.2018jamdsm0074","article-title":"Exact algorithms for the rectilinear block packing problem","volume":"12","author":"Matsushita","year":"2018","journal-title":"J. Adv. Mech. Des. Syst. Manuf."},{"key":"10.1016\/j.cor.2025.107276_b39","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1287\/ijoc.2021.1120","article-title":"Models and algorithms for the bin-packing problem with minimum color fragmentation","volume":"34","author":"Mehrani","year":"2022","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2025.107276_b40","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1590\/0101-7438.2016.036.02.0197","article-title":"A survey on heuristics for the two-dimensional rectangular strip packing problem","volume":"36","author":"Oliveira","year":"2016","journal-title":"Pesqui. Oper."},{"key":"10.1016\/j.cor.2025.107276_b41","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.ejor.2020.05.016","article-title":"Solving a large cutting problem in the glass manufacturing industry","volume":"287","author":"Parre\u00f1o","year":"2020","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b42","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119153","article-title":"Solving 3D packing problem using transformer network and reinforcement learning","volume":"214","author":"Que","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2025.107276_b43","doi-asserted-by":"crossref","first-page":"1891","DOI":"10.1016\/j.compchemeng.2005.04.004","article-title":"A cutting plane method for solving linear generalized disjunctive programming problems","volume":"29","author":"Sawaya","year":"2005","journal-title":"Comput. Chem. Eng."},{"year":"2018","author":"Sutton","series-title":"Reinforcement learning: An introduction","key":"10.1016\/j.cor.2025.107276_b44"},{"key":"10.1016\/j.cor.2025.107276_b45","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1007\/s10479-016-2112-9","article-title":"Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem","volume":"258","author":"Trespalacios","year":"2017","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b46","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.cor.2016.11.024","article-title":"An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation","volume":"80","author":"Wei","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107276_b47","first-page":"1","article-title":"Combinatorial benders\u2019 decomposition for the constrained two-dimensional non-guillotine cutting problem with defects","author":"Yao","year":"2024","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2025.107276_b48","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2025.110866","article-title":"An exact approach for the two-dimensional strip packing problem with defects","author":"Yao","year":"2025","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2025.107276_b49","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106407","article-title":"Exact approaches for the unconstrained two-dimensional cutting problem with defects","volume":"160","author":"Zhang","year":"2023","journal-title":"Comput. Oper. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825003053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825003053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T14:40:39Z","timestamp":1760798439000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054825003053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":49,"alternative-id":["S0305054825003053"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2025.107276","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Solving the strip packing problem with a decomposition framework and a generic solver: Implementation, tuning, and reinforcement-learning-based hybridization","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2025.107276","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107276"}}