{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T00:03:34Z","timestamp":1770077014574,"version":"3.49.0"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1016\/j.disopt.2025.100927","type":"journal-article","created":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T03:57:17Z","timestamp":1766721437000},"page":"100927","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Column (and row) generation algorithms for the pallet loading problem"],"prefix":"10.1016","volume":"59","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2694-4758","authenticated-orcid":false,"given":"Javier","family":"Marenco","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2025.100927_b1","article-title":"New approaches to the pallet loading problem","author":"Neli\u00dfen","year":"1993"},{"key":"10.1016\/j.disopt.2025.100927_b2","series-title":"Packing in Two and Three Dimensions","author":"Martins","year":"2003"},{"issue":"1","key":"10.1016\/j.disopt.2025.100927_b3","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."},{"issue":"11","key":"10.1016\/j.disopt.2025.100927_b4","doi-asserted-by":"crossref","first-page":"3007","DOI":"10.1016\/j.cor.2004.04.010","article-title":"A branch-and-cut algorithm for the pallet loading problem","volume":"32","author":"Alvarez-Valdes","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.disopt.2025.100927_b5","doi-asserted-by":"crossref","first-page":"2695","DOI":"10.1016\/j.cor.2005.10.008","article-title":"Lagrangean relaxation with clusters and column generation for the manufacturer\u2019s pallet loading problem","volume":"34","author":"Ribeiro","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.disopt.2025.100927_b6","doi-asserted-by":"crossref","unstructured":"K.-C. Wu, C.-J. Ting, A two-phase algorithm for the manufacturer\u2019s pallet loading problem, in: 2007 IEEE International Conference on Industrial Engineering and Engineering Management, 2007, pp. 1574\u20131578.","DOI":"10.1109\/IEEM.2007.4419457"},{"issue":"3","key":"10.1016\/j.disopt.2025.100927_b7","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/S0377-2217(97)00272-5","article-title":"An exact depth-first algorithm for the pallet loading problem","volume":"110","author":"Bhattacharya","year":"1998","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.disopt.2025.100927_b8","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0377-2217(87)90140-8","article-title":"An exact algorithm for the pallet loading problem","volume":"31","author":"Dowsland","year":"1987","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.disopt.2025.100927_b9","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.ejor.2006.11.012","article-title":"Solving the pallet loading problem","volume":"184","author":"Martins","year":"2008","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.disopt.2025.100927_b10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1057\/jors.1982.54","article-title":"An application of the micro to product design and distribution","volume":"33","author":"Bischoff","year":"1982","journal-title":"J. Oper. Res. Soc."},{"issue":"8","key":"10.1016\/j.disopt.2025.100927_b11","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1057\/palgrave.jors.2600588","article-title":"A simple and effective recursive procedure for the manufacturer\u2019s pallet loading problem","volume":"49","author":"Morabito","year":"1998","journal-title":"J. Oper. Res. Soc."},{"issue":"7","key":"10.1016\/j.disopt.2025.100927_b12","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1057\/palgrave.jors.2601553","article-title":"An L-approach for packing (\u2113, w)-rectangles into rectangular and L-shaped pieces","volume":"54","author":"Lins","year":"2003","journal-title":"J. Oper. Res. Soc."},{"issue":"12","key":"10.1016\/j.disopt.2025.100927_b13","doi-asserted-by":"crossref","first-page":"1448","DOI":"10.1057\/palgrave.jors.2601960","article-title":"A note on an L-approach for solving the manufacturer\u2019s pallet loading problem","volume":"56","author":"Birgin","year":"2005","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"10.1016\/j.disopt.2025.100927_b14","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":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.disopt.2025.100927_b15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0377-2217(00)00249-6","article-title":"A fast algorithm for two-dimensional pallet loading problems of large size","volume":"134","author":"Young-Gun","year":"2001","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.disopt.2025.100927_b16","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1057\/jors.1996.57","article-title":"The G4-heuristic for the pallet loading problem","volume":"47","author":"Scheithauer","year":"1996","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"10.1016\/j.disopt.2025.100927_b17","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1111\/j.1475-3995.2009.00715.x","article-title":"The pinwheel pattern and its application to the manufacturer\u2019s pallet-loading problem","volume":"16","author":"Yi","year":"2009","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"10.1016\/j.disopt.2025.100927_b18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00291-004-0183-5","article-title":"A tabu search algorithm for the pallet loading problem","volume":"27","author":"Alvarez-Vald\u00e9s","year":"2005","journal-title":"OR Spectrum"},{"issue":"3","key":"10.1016\/j.disopt.2025.100927_b19","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1016\/j.cor.2004.08.009","article-title":"Some experiments with a simple tabu search algorithm for the manufacturer\u2019s pallet loading problem","volume":"33","author":"Pureza","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.disopt.2025.100927_b20","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BF02125406","article-title":"A family of genetic algorithms for the pallet loading problem","volume":"63","author":"Herbert","year":"1996","journal-title":"Ann. Oper. Res."},{"issue":"18","key":"10.1016\/j.disopt.2025.100927_b21","doi-asserted-by":"crossref","first-page":"8304","DOI":"10.3390\/app11188304","article-title":"Application of machine learning methods for pallet loading problem","volume":"11","author":"Aylak","year":"2021","journal-title":"Appl. Sci."},{"key":"10.1016\/j.disopt.2025.100927_b22","doi-asserted-by":"crossref","unstructured":"S.B. Layeb, O. Omri, Solving the Pallet Loading Problem with Deep Reinforcement Learning, in: Proceedings of the 5th International Conference on Deep Learning, Big Data and Blockchain, Deep-BDB 2023, 2024.","DOI":"10.1007\/978-981-97-3820-5_17"},{"key":"10.1016\/j.disopt.2025.100927_b23","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1111\/itor.12099","article-title":"The pallet loading problem: a review of solution methods and computational experiments","volume":"23","author":"Silva","year":"2016","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.disopt.2025.100927_b24","series-title":"The Traveling Salesman Problem: A Computational Study","author":"Applegate","year":"2007"},{"issue":"4","key":"10.1016\/j.disopt.2025.100927_b25","doi-asserted-by":"crossref","first-page":"57","DOI":"10.22456\/2175-2745.80721","article-title":"Exact algorithms for the graph coloring problem","volume":"25","author":"de Lima","year":"2018","journal-title":"Rev. de Inform\u00e1tica Te\u00f3rica e Apl."},{"key":"10.1016\/j.disopt.2025.100927_b26","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.orl.2010.06.002","article-title":"A note on branch-and-cut-and-price","volume":"38","author":"Feillet","year":"2010","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.disopt.2025.100927_b27","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."},{"issue":"1","key":"10.1016\/j.disopt.2025.100927_b28","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","article-title":"Multilevel k-way partitioning scheme for irregular graphs","volume":"48","author":"Karypis","year":"1998","journal-title":"J. Parallel Distrib. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0743-7315","issn-type":"print"},{"key":"10.1016\/j.disopt.2025.100927_b29","doi-asserted-by":"crossref","first-page":"1040","DOI":"10.1016\/j.apm.2005.02.007","article-title":"Dynamic programming algorithms for the optimal cutting of equal rectangles","volume":"29","author":"Cui","year":"2005","journal-title":"Appl. Math. Model."},{"key":"10.1016\/j.disopt.2025.100927_b30","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105024","article-title":"The stable set problem: Clique and nodal inequalities revisited","volume":"123","author":"Letchford","year":"2020","journal-title":"Comput. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0305-0548","issn-type":"print"}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528625000507?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528625000507?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T12:10:07Z","timestamp":1770034207000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528625000507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":30,"alternative-id":["S1572528625000507"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2025.100927","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Column (and row) generation algorithms for the pallet loading problem","name":"articletitle","label":"Article Title"},{"value":"Discrete Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disopt.2025.100927","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"}],"article-number":"100927"}}