{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T18:28:28Z","timestamp":1779388108240,"version":"3.53.1"},"reference-count":59,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100006690","name":"Politecnico di Milano","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006690","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2024-04176"],"award-info":[{"award-number":["RGPIN-2024-04176"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejor.2025.11.037","type":"journal-article","created":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T17:32:28Z","timestamp":1764955948000},"page":"31-51","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Tetris Beam Search algorithm for the distributor\u2019s pallet loading problem"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6709-3737","authenticated-orcid":false,"given":"Davide","family":"Croci","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0697-7448","authenticated-orcid":false,"given":"Ola","family":"Jabali","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jacopo","family":"Lib\u00e8","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0034-1721","authenticated-orcid":false,"given":"Federico","family":"Malucelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joe","family":"Naoum-Sawaya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2025.11.037_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108122","article-title":"On-line three-dimensional packing problems: A review of off-line and on-line solution approaches","volume":"168","author":"Ali","year":"2022","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2025.11.037_bib0002","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.111168","article-title":"Heuristics for online three-dimensional packing problems and algorithm selection framework for semi-online with full look-ahead","volume":"151","author":"Ali","year":"2024","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.ejor.2025.11.037_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107005","article-title":"Static stability versus packing efficiency in online three-dimensional packing problems: A new approach and a computational study","volume":"178","author":"Ali","year":"2025","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.11.037_bib0004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2016\/3264214","article-title":"Algorithms for pallet building and truck loading in an interdepot transportation problem","volume":"2016","author":"Alonso","year":"2016","journal-title":"Mathematical Problems in Engineering"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.037_bib0005","doi-asserted-by":"crossref","first-page":"10006","DOI":"10.1016\/j.ifacol.2020.12.2719","article-title":"A hybrid genetic algorithm for pallet loading in real-world applications","volume":"53","author":"Ancora","year":"2020","journal-title":"IFAC-PapersOnLine"},{"key":"10.1016\/j.ejor.2025.11.037_bib0006","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.cor.2013.09.003","article-title":"A beam search approach to the container loading problem","volume":"43","author":"Araya","year":"2014","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.037_bib0007","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","article-title":"Orthogonal packings in two dimensions","volume":"9","author":"Baker","year":"1980","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.037_bib0008","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1057\/jors.2008.141","article-title":"An effective recursive partitioning approach for the packing of identical rectangles in a rectangle","volume":"61","author":"Birgin","year":"2010","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.037_bib0009","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0377-2217(90)90362-F","article-title":"A comparative evaluation of heuristics for container loading","volume":"44","author":"Bischoff","year":"1990","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.037_bib0010","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","article-title":"Issues in the development of approaches to container loading","volume":"23","author":"Bischoff","year":"1995","journal-title":"Omega"},{"issue":"9","key":"10.1016\/j.ejor.2025.11.037_bib0011","doi-asserted-by":"crossref","first-page":"2248","DOI":"10.1016\/j.cor.2011.11.008","article-title":"A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints","volume":"39","author":"Bortfeldt","year":"2012","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.037_bib0012","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.12.006","article-title":"Constraints in container loading - a state-of-the-art review","volume":"229","author":"Bortfeldt","year":"2013","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.037_bib0013","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":"Operations Research"},{"key":"10.1016\/j.ejor.2025.11.037_bib0014","article-title":"Knapsack problems - an overview of recent advances. part II: Multiple, multidimensional, and quadratic knapsack problems","volume":"143","author":"Cacchiani","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.037_bib0015","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1016\/j.cie.2013.07.025","article-title":"Local search techniques for a routing-packing problem","volume":"66","author":"Ceschia","year":"2013","journal-title":"Computers & Industrial Engineering"},{"issue":"8","key":"10.1016\/j.ejor.2025.11.037_bib0016","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1109\/TC.1983.1676307","article-title":"The bottom-left bin-packing heuristic: An efficient implementation","volume":"100","author":"Chazelle","year":"1983","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/j.ejor.2025.11.037_bib0017","unstructured":"Chevalier S. (2022). Global retail e-commerce sales 2014\u20132026. https:\/\/www.statista.com\/statistics\/379046\/worldwide-retail-e-commerce-sales\/."},{"issue":"6","key":"10.1016\/j.ejor.2025.11.037_bib0018","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1111\/j.1475-3995.2009.00714.x","article-title":"Container loading with multi-drop constraints","volume":"16","author":"Christensen","year":"2009","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.037_bib0019","doi-asserted-by":"crossref","DOI":"10.1287\/ijoc.1070.0250","article-title":"Extreme point-based heuristics for three-dimensional bin packing","volume":"20","author":"Crainic","year":"2008","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.037_bib0020","doi-asserted-by":"crossref","first-page":"53","DOI":"10.3390\/mca26030053","article-title":"Solving a real-life distributor\u2019s pallet loading problem","volume":"26","author":"Dell\u2019Amico","year":"2021","journal-title":"Mathematical and Computational Applications"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.037_bib0021","doi-asserted-by":"crossref","first-page":"3244","DOI":"10.1111\/itor.12740","article-title":"A mixed-integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins\u2019 priority","volume":"28","author":"Deplano","year":"2021","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.037_bib0022","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Mathematical Programming"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.037_bib0023","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1057\/palgrave.jors.2600563","article-title":"Jostling for position: Local improvement for irregular cutting patterns","volume":"49","author":"Dowsland","year":"1998","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.037_bib0024","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1287\/ijoo.2019.0013","article-title":"Three-dimensional bin packing and mixed-case palletization","volume":"1","author":"Elhedhli","year":"2019","journal-title":"INFORMS Journal on Optimization"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.037_bib0025","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1287\/ijoc.1090.0338","article-title":"A tree search algorithm for solving the container loading problem","volume":"22","author":"Fanslau","year":"2010","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.037_bib0026","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/trsc.1050.0145","article-title":"A tabu search algorithm for a routing and container loading problem","volume":"40","author":"Gendreau","year":"2006","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.037_bib0027","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0305-0548(80)90001-5","article-title":"A heuristic for packing boxes into a container","volume":"7","author":"George","year":"1980","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.037_bib0028","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0377-2217(02)00130-3","article-title":"A 2-exchange heuristic for nesting problems","volume":"141","author":"Gomes","year":"2002","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.037_bib0029","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.cor.2011.03.009","article-title":"A parallel multi-population biased random-key genetic algorithm for a container loading problem","volume":"39","author":"Gon\u00e7alves","year":"2012","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.11.037_bib0030","series-title":"2021 6th international conference on information technology research (ICITR)","first-page":"1","article-title":"Solve manufacturer's pallet loading problem (MPLP) with practical warehouse constraints","author":"Gunawardena","year":"2021"},{"key":"10.1016\/j.ejor.2025.11.037_bib0031","doi-asserted-by":"crossref","DOI":"10.3389\/fmech.2022.966691","article-title":"Two-dimensional irregular packing problems: A review","volume":"8","author":"Guo","year":"2022","journal-title":"Frontiers in Mechanical Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.037_bib0032","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1016\/j.ejor.2020.04.053","article-title":"The pallet loading problem: Three-dimensional bin packing with practical constraints","volume":"287","author":"Gzara","year":"2020","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.037_bib0033","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/05695558208975057","article-title":"A combined approach to the pallet loading problem","volume":"14","author":"Hodgson","year":"1982","journal-title":"A I I E Transactions"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.037_bib0034","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1504\/EJIE.2019.102155","article-title":"A novel hierarchical approach for a heterogeneous 3D pallet loading problem subject to factual loading and delivery constraints","volume":"13","author":"K\u0131r","year":"2019","journal-title":"European Journal of Industrial Engineering"},{"key":"10.1016\/j.ejor.2025.11.037_bib0035","series-title":"Game programming gems 4","author":"Kirmse","year":"2004"},{"issue":"S1","key":"10.1016\/j.ejor.2025.11.037_bib0036","doi-asserted-by":"crossref","DOI":"10.1121\/1.2003013","article-title":"Harpy, a connected speech recognition system","volume":"59","author":"Lowerre","year":"1976","journal-title":"The Journal of the Acoustical Society of America"},{"key":"10.1016\/j.ejor.2025.11.037_bib0037","article-title":"The three-dimensional bin packing problem","volume":"48","author":"Martello","year":"1998","journal-title":"Operations Research"},{"issue":"8","key":"10.1016\/j.ejor.2025.11.037_bib0038","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1057\/palgrave.jors.2600588","article-title":"A simple and effective recursive procedure for the manufacturer's pallet loading problem","volume":"49","author":"Morabito","year":"1998","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2025.11.037_bib0039","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105186","article-title":"Practical constraints in the container loading problem: Comprehensive formulations and exact algorithm","volume":"128","author":"Nascimento","year":"2021","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.11.037_bib0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105521","article-title":"The rectangular two-dimensional strip packing problem real-life practical constraints: A bibliometric overview","volume":"137","author":"Neuenfeldt J\u00fanior","year":"2022","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.11.037_bib0041","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s002910050105","article-title":"Topos\u2013a new constructive algorithm for nesting problems: Topos\u2013ein neues konstruktionsverfahren f\u00fcr das \u201cnesting-problem\u201d","volume":"22","author":"Oliveira","year":"2000","journal-title":"OR-Spektrum"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.037_bib0042","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":"Pesquisa Operacional"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.037_bib0043","doi-asserted-by":"crossref","first-page":"1581","DOI":"10.1080\/00207543.2017.1355577","article-title":"MIP-based constructive heuristics for the three-dimensional bin packing problem with transportation constraints","volume":"56","author":"Paquay","year":"2018","journal-title":"International Journal of Production Research"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2025.11.037_bib0044","first-page":"187","article-title":"A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application","volume":"23","author":"Paquay","year":"2014","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.037_bib0045","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/ijoc.1070.0254","article-title":"A maximal-space algorithm for the container loading problem","volume":"20","author":"Parre\u00f1o","year":"2008","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2025.11.037_bib0046","unstructured":"Pazitnov A.L. (1984). Tetris."},{"key":"10.1016\/j.ejor.2025.11.037_bib0047","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/j.trb.2016.06.003","article-title":"A container loading algorithm with static mechanical equilibrium stability constraints","volume":"91","author":"Ramos","year":"2016","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1-2","key":"10.1016\/j.ejor.2025.11.037_bib0048","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1111\/itor.12124","article-title":"A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions","volume":"23","author":"Ramos","year":"2014","journal-title":"International Transactions in Operational Research"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2025.11.037_bib0049","first-page":"147","article-title":"The pallet loading problem: A review of solution methods and computational experiments","volume":"23","author":"Silva","year":"2014","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2025.11.037_bib0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105058","article-title":"A matheuristic framework for the three-dimensional single large object placement problem with practical constraints","volume":"124","author":"Silva","year":"2020","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.11.037_bib0051","series-title":"Distributed computing and artificial intelligence, 13th international conference","first-page":"535","article-title":"3D Pallet stacking with rigorous vertical stability","author":"S\u00f8rensen","year":"2016"},{"issue":"10","key":"10.1016\/j.ejor.2025.11.037_bib0052","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1287\/mnsc.25.10.997","article-title":"Generating pallet loading patterns: A special case of the two-dimensional cutting stock problem","volume":"25","author":"Steudel","year":"1979","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.037_bib0053","doi-asserted-by":"crossref","first-page":"1599","DOI":"10.1109\/TASE.2022.3177422","article-title":"Automating bin packing: A layer building matheuristics for cost effective logistics","volume":"19","author":"Tresca","year":"2022","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.037_bib0054","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1618452.1618458","article-title":"Procedural modeling of structurally-sound masonry buildings","volume":"28","author":"Whiting","year":"2009","journal-title":"ACM Transactions on Graphics"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.037_bib0055","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","article-title":"An improved typology of cutting and packing problems","volume":"183","author":"W\u00e4scher","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"10.1016\/j.ejor.2025.11.037_bib0056","doi-asserted-by":"crossref","first-page":"2267","DOI":"10.1016\/j.cor.2011.10.019","article-title":"A heuristic block-loading algorithm based on multi-layer search for the container loading problem","volume":"39","author":"Zhang","year":"2012","journal-title":"Computers & Operations Research"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2025.11.037_bib0057","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1111\/itor.12094","article-title":"A comparative review of 3d container loading algorithms","volume":"23","author":"Zhao","year":"2016","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.037_bib0058","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1016\/j.ejor.2024.02.007","article-title":"3D dynamic heterogeneous robotic palletization problem","volume":"316","author":"Zhu","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.037_bib0059","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s10489-012-0337-0","article-title":"The six elements to block-building approaches for the single container loading problem","volume":"37","author":"Zhu","year":"2012","journal-title":"Applied Intelligence"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009658?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009658?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T05:29:19Z","timestamp":1773293359000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725009658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["S0377221725009658"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.037","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Tetris Beam Search algorithm for the distributor\u2019s pallet loading problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.037","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}