{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T01:44:09Z","timestamp":1785894249940,"version":"3.56.0"},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T00:00:00Z","timestamp":1781481600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100030708","name":"Artificial and Natural Intelligence Toulouse Institute","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100030708","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["CZ.02.01.01\/00\/22_008\/0004590"],"award-info":[{"award-number":["CZ.02.01.01\/00\/22_008\/0004590"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107581","type":"journal-article","created":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T06:42:35Z","timestamp":1781332955000},"page":"107581","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Hierarchical rectangle packing solved by multi-level recursive logic-based benders decomposition"],"prefix":"10.1016","volume":"194","author":[{"given":"Josef","family":"Grus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8135-1296","authenticated-orcid":false,"given":"Zden\u011bk","family":"Hanz\u00e1lek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Artigues","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cyrille","family":"Briand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emmanuel","family":"Hebrard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107581_b1","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.ejor.2025.06.006","article-title":"Nested logic-based benders decomposition for an integrated home healthcare problem","volume":"328","author":"Algendi","year":"2026","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.orl.2011.10.008","article-title":"A space-indexed formulation of packing boxes into a larger box","volume":"40","author":"Allen","year":"2012","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.cor.2026.107581_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-Valdes","year":"2009","journal-title":"OR Spectrum"},{"key":"10.1016\/j.cor.2026.107581_b4","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","volume":"33","author":"Beasley","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b5","series-title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19","first-page":"6267","article-title":"A survey on hierarchical planning \u2013 one abstract idea, many concrete realizations","author":"Bercher","year":"2019"},{"key":"10.1016\/j.cor.2026.107581_b6","series-title":"Operations Research Proceedings 2008","first-page":"427","article-title":"A constraint-based approach for the two-dimensional rectangular packing problem with orthogonal orientations","author":"Berger","year":"2009"},{"key":"10.1016\/j.cor.2026.107581_b7","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.2026.107581_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106410","article-title":"Metaheuristics for bilevel optimization: A comprehensive review","volume":"161","author":"Camacho-Vallejo","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b9","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1109\/TC.1983.1676307","article-title":"The bottomn-left bin-packing heuristic: An efficient implementation","volume":"C-32","author":"Chazelle","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.cor.2026.107581_b10","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(94)00002-T","article-title":"An analytical model for the container loading problem","volume":"80","author":"Chen","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b11","series-title":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD \u201919","first-page":"1762","article-title":"A data-driven approach for multi-level packing problems in manufacturing industry","author":"Chen","year":"2019"},{"key":"10.1016\/j.cor.2026.107581_b12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.ejor.2007.08.007","article-title":"Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation","volume":"191","author":"Cintra","year":"2008","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b13","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.2026.107581_b14","series-title":"A primal decomposition algorithm for the two-dimensional bin packing problem","author":"C\u00f4t\u00e9","year":"2019"},{"key":"10.1016\/j.cor.2026.107581_b15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.psep.2019.01.021","article-title":"Optimal plant layout considering the safety instrumented system design for hazardous equipment","volume":"124","author":"de Lira-Flores","year":"2019","journal-title":"Process. Saf. Environ. Prot."},{"key":"10.1016\/j.cor.2026.107581_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2019.104825","article-title":"A branch-and-price algorithm for the temporal bin packing problem","volume":"114","author":"Dell\u2019Amico","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b17","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.2026.107581_b18","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","article-title":"A linear programming approach to the cutting-stock problem","volume":"9","author":"Gilmore","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b19","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","article-title":"Multistage cutting stock problems of two and more dimensions","volume":"13","author":"Gilmore","year":"1965","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b20","series-title":"Hierarchical rectangle packing solved by multi-level recursive logic-based benders decomposition","author":"Grus","year":"2026"},{"key":"10.1016\/j.cor.2026.107581_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107072","article-title":"Periodic chains scheduling on dedicated resources - a crucial problem in time-sensitive networks","volume":"180","author":"Grus","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106643","article-title":"Automated placement of analog integrated circuits using priority-based constructive heuristic","volume":"167","author":"Grus","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b23","series-title":"Instances for the two-dimensional hierarchical packing (2dhrp) problem","author":"Grus","year":"2025"},{"key":"10.1016\/j.cor.2026.107581_b24","first-page":"1","article-title":"Nested logic-based benders decomposition for disaster preparedness planning with horizontal coordination","author":"Guo","year":"2025","journal-title":"IISE Trans."},{"key":"10.1016\/j.cor.2026.107581_b25","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.cor.2009.05.008","article-title":"The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio","volume":"37","author":"Imahori","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b26","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/j.ejor.2020.06.050","article-title":"Exact solution techniques for two-dimensional cutting and packing","volume":"289","author":"Iori","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b27","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10479-008-0463-6","article-title":"Optimal rectangle packing","volume":"179","author":"Korf","year":"2010","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b28","doi-asserted-by":"crossref","DOI":"10.3390\/app13085032","article-title":"Facility layout problem with alternative facility variants","volume":"13","author":"Kubal\u00edk","year":"2023","journal-title":"Appl. Sci."},{"key":"10.1016\/j.cor.2026.107581_b29","series-title":"Applications of Evolutionary Computation","first-page":"301","article-title":"Dynamic hierarchical structure optimisation for cloud computing job scheduling","author":"Lane","year":"2022"},{"key":"10.1016\/j.cor.2026.107581_b30","series-title":"Solving the multi-level bin packing problem with time windows using integer programming","author":"Le Blansch","year":"2022"},{"key":"10.1016\/j.cor.2026.107581_b31","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110838","article-title":"Exact algorithms in bar nesting: How to cut general items from linear stocks so that wastage is minimised","volume":"200","author":"Lewis","year":"2025","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107581_b32","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.cor.2015.04.024","article-title":"Models and algorithms for packing rectangles into the smallest square","volume":"63","author":"Martello","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b33","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.2026.107581_b34","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.ejor.2019.05.038","article-title":"Scheduling with uncertain processing times in mixed-criticality systems","volume":"279","author":"Novak","year":"2019","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b35","doi-asserted-by":"crossref","first-page":"3238","DOI":"10.1111\/itor.13236","article-title":"An introduction to the two-dimensional rectangular cutting and packing problem","volume":"30","author":"Oliveira","year":"2023","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b36","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.2026.107581_b37","first-page":"3451","article-title":"Bayesian network learning via topological order","volume":"18","author":"Park","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.cor.2026.107581_b38","doi-asserted-by":"crossref","first-page":"2824","DOI":"10.1109\/TSC.2021.3079110","article-title":"Hierarchical scheduling mechanisms in multi-level fog computing","volume":"15","author":"Peixoto","year":"2022","journal-title":"IEEE Trans. Serv. Comput."},{"key":"10.1016\/j.cor.2026.107581_b39","series-title":"Cp-sat","author":"Perron","year":"2025"},{"key":"10.1016\/j.cor.2026.107581_b40","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/ijoc.1060.0181","article-title":"Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem","volume":"19","author":"Pisinger","year":"2007","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107581_b41","series-title":"Hybrid Metaheuristics","first-page":"183","article-title":"Speeding up logic-based benders\u2019 decomposition by a metaheuristic for a bi-level capacitated vehicle routing problem","author":"Raidl","year":"2014"},{"key":"10.1016\/j.cor.2026.107581_b42","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.endm.2014.11.020","article-title":"Boosting an exact logic-based benders decomposition approach by variable neighborhood search","volume":"47","author":"Raidl","year":"2015","journal-title":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.cor.2026.107581_b43","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1016\/j.ijhydene.2024.09.345","article-title":"Electrification of transportation: A hybrid benders\/sddp algorithm for optimal charging station trading","volume":"89","author":"Sohrabi","year":"2024","journal-title":"Int. J. Hydrog. Energy"},{"key":"10.1016\/j.cor.2026.107581_b44","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/j.ejor.2019.01.041","article-title":"Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies","volume":"276","author":"Tilk","year":"2019","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107581_b45","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1287\/mnsc.47.6.864.9809","article-title":"A nested decomposition approach to a three-stage, two-dimensional cutting-stock problem","volume":"47","author":"Vanderbeck","year":"2001","journal-title":"Manag. Sci."},{"key":"10.1016\/j.cor.2026.107581_b46","series-title":"Proceedings of the 2017 ACM on International Symposium on Physical Design, ISPD \u201917","first-page":"55","article-title":"Hierarchical and analytical placement techniques for high-performance analog circuits","author":"Xu","year":"2017"},{"key":"10.1016\/j.cor.2026.107581_b47","article-title":"An exact algorithm for placement optimization in circuit design","author":"Zhang","year":"2025","journal-title":"Engineering"},{"key":"10.1016\/j.cor.2026.107581_b48","doi-asserted-by":"crossref","first-page":"2689","DOI":"10.1109\/TCAD.2022.3230367","article-title":"Hierarchical analog and mixed-signal circuit placement considering system signal flow","volume":"42","author":"Zhu","year":"2023","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001991?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001991?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T00:47:49Z","timestamp":1785890869000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":48,"alternative-id":["S0305054826001991"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107581","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hierarchical rectangle packing solved by multi-level recursive logic-based benders decomposition","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107581","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107581"}}