{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:42:30Z","timestamp":1767339750958,"version":"3.44.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T00:00:00Z","timestamp":1635120000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T00:00:00Z","timestamp":1635120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100009104","name":"Universit\u00e0 Degli Studi di Modena e Reggio Emila","doi-asserted-by":"publisher","award":["FAR2018"],"award-info":[{"award-number":["FAR2018"]}],"id":[{"id":"10.13039\/100009104","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In the pallet building problem, we aim at loading a given set of items into one or more pallets, by satisfying specific constraints and minimizing the number of pallets used. In this paper, we address a practical case of this problem that originates from a real-world robotized application, subject to some non-trivial operational constraints. In practice, items are grouped into families and must be packed into horizontal layers. To facilitate loading\/unloading operations, items of the same type packed into the same layer should be contiguous and at least one of them should be visible from the outside. We present a formal mathematical description for layer and pallet creation subproblems and then we propose heuristic, metaheuristic, matheuristic algorithms to solve the overall problem. The performance of the algorithms is assessed through extensive computational tests on real-world instances.<\/jats:p>","DOI":"10.1007\/s10479-021-04349-w","type":"journal-article","created":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T22:02:34Z","timestamp":1635112954000},"page":"5-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Mathematical models and heuristic algorithms for pallet building problems with practical constraints"],"prefix":"10.1007","volume":"350","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2748-2068","authenticated-orcid":false,"given":"Gabriele","family":"Calzavara","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2097-6572","authenticated-orcid":false,"given":"Manuel","family":"Iori","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7138-8653","authenticated-orcid":false,"given":"Marco","family":"Locatelli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5935-846X","authenticated-orcid":false,"given":"Mayron C. O.","family":"Moreira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8118-6633","authenticated-orcid":false,"given":"Tiago","family":"Silveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,25]]},"reference":[{"key":"4349_CR1","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1016\/j.cie.2018.11.012","volume":"127","author":"M Alonso","year":"2019","unstructured":"Alonso, M., Alvarez-Valdes, R., Iori, M., & Parre\u00f1o, F. (2019). Mathematical models for multi container loading problems with practical constraints. Computers & Industrial Engineering, 127, 722\u2013733.","journal-title":"Computers & Industrial Engineering"},{"key":"4349_CR2","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.omega.2016.02.002","volume":"66","author":"M Alonso","year":"2017","unstructured":"Alonso, M., Alvarez-Valdes, R., Iori, M., Parre\u00f1o, F., & Tamarit, J. (2017). Mathematical models for multi container loading problems. OMEGA, 66, 106\u2013117.","journal-title":"OMEGA"},{"key":"4349_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10288-018-0397-z","volume":"18","author":"M Alonso","year":"2020","unstructured":"Alonso, M., Alvarez-Valdes, R., & Parre\u00f1o, F. (2020). A GRASP algorithm for multi container loading problems with practical constraints. 4OR-Q. J Oper Res, 18, 49\u201372.","journal-title":"J Oper Res"},{"key":"4349_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2016\/3264214","volume":"2016","author":"M Alonso","year":"2016","unstructured":"Alonso, M., Alvarez-Valdes, R., Parre\u00f1o, F., & Tamarit, J. (2016). Algorithms for pallet building and truck loading in an interdepot transportation problem. Mathematical Problems in Engineering, 2016, 1\u201311.","journal-title":"Mathematical Problems in Engineering"},{"key":"4349_CR5","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 & Operations Research, 35, 1065\u20131083.","journal-title":"Computers & Operations Research"},{"key":"4349_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","volume":"23","author":"E Bischoff","year":"1995","unstructured":"Bischoff, E., & Ratcliff, M. (1995). Issues in the development of approaches to container loading. Omega, 23, 377\u2013390.","journal-title":"Omega"},{"key":"4349_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0377-2217(00)00055-2","volume":"131","author":"A Bortfeldt","year":"2001","unstructured":"Bortfeldt, A., & Gehring, H. (2001). A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research, 131, 143\u2013161.","journal-title":"European Journal of Operational Research"},{"key":"4349_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.12.006","volume":"229","author":"A Bortfeldt","year":"2013","unstructured":"Bortfeldt, A., & W\u00e4scher, G. (2013). Constraints in container loading - a state-of-the-art review. European Journal of Operational Research, 229, 1\u201320.","journal-title":"European Journal of Operational Research"},{"key":"4349_CR9","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"E Burke","year":"2004","unstructured":"Burke, E., Kendall, G., & Whitwell, G. (2004). A new placement heuristic for the orthogonal stock-cutting problem. Operations Research, 52, 655\u2013671.","journal-title":"Operations Research"},{"key":"4349_CR10","doi-asserted-by":"crossref","unstructured":"Chazelle, B. (1983). The bottomn-left bin-packing heuristic: An efficient implementation. IEEE Transactions on Computers C-32, 697\u2013707.","DOI":"10.1109\/TC.1983.1676307"},{"key":"4349_CR11","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1287\/ijoc.1070.0250","volume":"20","author":"T Crainic","year":"2008","unstructured":"Crainic, T., Perboli, G., & Tadei, R. (2008). Extreme point-based heuristics for three-dimensional bin packing. INFORMS Journal on Computing, 20, 368\u2013384.","journal-title":"INFORMS Journal on Computing"},{"key":"4349_CR12","unstructured":"Crainic, T., Perboli, G., & Tadei, R. (2012). Recent advances in multi-dimensional packing problems. In: New Technologies, chap., 5, IntechOpen."},{"key":"4349_CR13","doi-asserted-by":"crossref","unstructured":"C\u00f4t\u00e9, J. F., Dell\u2019Amico, M., & Iori, M. (2014). Combinatorial benders\u2019 cuts for the strip packing problem. Operations Research,62, 643\u2013661.","DOI":"10.1287\/opre.2013.1248"},{"key":"4349_CR14","doi-asserted-by":"crossref","unstructured":"C\u00f4t\u00e9, J. F., Haouari, M., & Iori, M. (2021). Combinatorial benders decomposition for the two-dimensional bin packing problem. INFORMS J Comput 1\u201316.","DOI":"10.1287\/ijoc.2020.1014"},{"key":"4349_CR15","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.ijpe.2013.04.032","volume":"145","author":"T de Queiroz","year":"2013","unstructured":"de Queiroz, T., & Miyazawa, F. (2013). Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints. International Journal of Production Economics, 145, 511\u2013530.","journal-title":"International Journal of Production Economics"},{"key":"4349_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10479-014-1634-2","volume":"223","author":"T de Queiroz","year":"2014","unstructured":"de Queiroz, T., & Miyazawa, F. (2014). Order and static stability into the strip packing problem. Annals of Operations Research, 223, 137\u2013154.","journal-title":"Annals of Operations Research"},{"key":"4349_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme, M., Iori, M., & Martello, S. (2016). Bin packing and cutting stock problems: Mathematical models and exact algorithms. European Journal of Operational Research, 255, 1\u201320.","journal-title":"European Journal of Operational Research"},{"key":"4349_CR18","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.cor.2016.09.009","volume":"78","author":"M Delorme","year":"2017","unstructured":"Delorme, M., Iori, M., & Martello, S. (2017). Logic based benders decomposition for orthogonal stock cutting problems. Computers & Operations Research, 78, 290\u2013298.","journal-title":"Computers & Operations Research"},{"key":"4349_CR19","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.ejor.2009.01.048","volume":"200","author":"J Egeblad","year":"2010","unstructured":"Egeblad, J., Garavelli, C., Lisi, S., & Pisinger, D. (2010). Heuristics for container loading of furniture. European Journal of Operational Research, 200, 881\u2013892.","journal-title":"European Journal of Operational Research"},{"key":"4349_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T Feo","year":"1989","unstructured":"Feo, T., & Resende, M. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8, 67\u201371.","journal-title":"Operations Research Letters"},{"key":"4349_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T Feo","year":"1995","unstructured":"Feo, T., & Resende, M. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"4349_CR22","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"P Gilmore","year":"1965","unstructured":"Gilmore, P., & Gomory, R. (1965). Multistage cutting stock problems of two or more dimensions. Operations Research, 13, 94\u2013120.","journal-title":"Operations Research"},{"key":"4349_CR23","unstructured":"Gottschalk, S.: Separating axis theorem. (1996). Tech. rep., Technical Report TR96-024, Department of Computer Science. UNC Chapel Hill."},{"key":"4349_CR24","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0377-2217(90)90364-H","volume":"44","author":"R Haessler","year":"1990","unstructured":"Haessler, R., & Talbot, F. (1990). Load planning for shipments of low density products. European Journal of Operational Research, 44, 289\u2013299.","journal-title":"European Journal of Operational Research"},{"key":"4349_CR25","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.cor.2009.05.008","volume":"37","author":"S Imahori","year":"2010","unstructured":"Imahori, S., & Yagiura, M. (2010). The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio. Computers & Operations Research, 37, 325\u2013333.","journal-title":"Computers & Operations Research"},{"key":"4349_CR26","doi-asserted-by":"crossref","unstructured":"Iori, M., de Lima, V., Martello, S., Miyazawa, F., Monaci, M.: Exact solution techniques for two-dimensional cutting and packing. European Journal of Operational Research 289(2), 399\u2013415 (2021).","DOI":"10.1016\/j.ejor.2020.06.050"},{"key":"4349_CR27","doi-asserted-by":"crossref","unstructured":"Iori, M., Locatelli, M., Moreira, M., Silveira, T.: Reactive GRASP-based algorithm for pallet building problem with visibility and contiguity constraints. In: Lalla-Ruiz E., Mes M., Vo\u00df S. (eds) Computational Logistics. ICCL 2020. Lecture Notes in Computer Science, vol. 12433. Springer, Cham (2020a).","DOI":"10.1007\/978-3-030-59747-4_42"},{"key":"4349_CR28","doi-asserted-by":"crossref","unstructured":"Iori, M., Locatelli, M., Moreira, M., Silveira, T.: Solution of a practical pallet building problem with visibility and contiguity constraints. In: International Conference on Enterprise Information Systems, vol.\u00a01, pp. 327\u2013338. SciTePress (2020b).","DOI":"10.5220\/0009351703270338"},{"key":"4349_CR29","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-75418-1_7","volume-title":"Enterprise Information Systems","author":"M Iori","year":"2021","unstructured":"Iori, M., Locatelli, M., Moreira, M., & Silveira, T. (2021). A mixed approach for pallet building problem with practical constraints. In J. Filipe, M. \u015amia\u0142ek, A. Brodsky, & S. Hammoudi (Eds.), Enterprise Information Systems (Vol. 417, pp. 122\u2013139). Cham: Springer."},{"key":"4349_CR30","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M Iori","year":"2010","unstructured":"Iori, M., & Martello, S. (2010). Routing problems with loading constraints. TOP, 18, 4\u201327.","journal-title":"TOP"},{"key":"4349_CR31","doi-asserted-by":"crossref","unstructured":"Jovanovic, R., Tuba, M., & Vo\u00df, S. (2019). Fixed set search applied to the traveling salesman problem (pp. 63\u201377). International Workshop on Hybrid Metaheuristics.","DOI":"10.1007\/978-3-030-05983-5_5"},{"key":"4349_CR32","doi-asserted-by":"crossref","unstructured":"Jovanovic, R., Vo\u00df, S.: Fixed set search applied to the minimum weighted vertex cover problem. In: Analysis of Experimental Algorithms, SEA 2019, vol. 11544, pp. 490\u2013504. Springer (2019)","DOI":"10.1007\/978-3-030-34029-2_31"},{"key":"4349_CR33","doi-asserted-by":"crossref","unstructured":"Jovanovic, R., & Vo\u00df, S. (2020). The fixed set search applied to the power dominating set problem. Expert Systems (p. (p. e12559).)","DOI":"10.1111\/exsy.12559"},{"key":"4349_CR34","doi-asserted-by":"publisher","first-page":"29","DOI":"10.2478\/emj-2018-0009","volume":"10","author":"J J\u00f3zefowska","year":"2018","unstructured":"J\u00f3zefowska, J., Pawlak, G., Pesch, E., Morze, M., & Kowalski, D. (2018). Fast truck-packing of 3D boxes. Engineering Management in Production and Services, 10, 29\u201340.","journal-title":"Engineering Management in Production and Services"},{"key":"4349_CR35","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ejor.2019.12.012","volume":"284","author":"D Kurpel","year":"2020","unstructured":"Kurpel, D., Scarpin, C., P\u00e9cora Junior, J., Schenekemberg, C., & Coelho, L. (2020). The exact solutions of several types of container loading problems. European Journal of Operational Research, 284, 87\u2013107.","journal-title":"European Journal of Operational Research"},{"key":"4349_CR36","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2011.06.002","volume":"215","author":"S Leung","year":"2011","unstructured":"Leung, S., Zhang, D., & Sim, K. (2011). A two-stage intelligent search algorithm for the two-dimensional strip packing problem. European Journal of Operational Research, 215, 57\u201369.","journal-title":"European Journal of Operational Research"},{"key":"4349_CR37","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.cor.2010.09.002","volume":"38","author":"J Liu","year":"2011","unstructured":"Liu, J., Yue, Y., Dong, Z., Maple, C., & Keech, M. (2011). A novel hybrid tabu search approach to container loading. Computers and Operations Research, 38, 797\u2013807.","journal-title":"Computers and Operations Research"},{"key":"4349_CR38","doi-asserted-by":"crossref","unstructured":"Lodi, A., Martello, S., Monaci, M., & Vigo, D. (2014). Two-Dimensional Bin Packing Problems (pp. 107\u2013129). John Wiley & Sons Ltd.","DOI":"10.1002\/9781119005353.ch5"},{"key":"4349_CR39","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10479-008-0449-4","volume":"179","author":"F Parre\u00f1o","year":"2010","unstructured":"Parre\u00f1o, F., Alvarez-Valdes, R., Oliveira, J., & Tamarit, J. (2010). A hybrid grasp\/vnd algorithm for two- and three-dimensional bin packing. Annals of Operations Research, 179, 203\u2013220.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"4349_CR40","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M Prais","year":"2000","unstructured":"Prais, M., & Ribeiro, C. (2000). Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12(3), 164\u2013176.","journal-title":"INFORMS Journal on Computing"},{"key":"4349_CR41","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.eswa.2019.07.020","volume":"137","author":"R Ranck J\u00fanior","year":"2019","unstructured":"Ranck J\u00fanior, R., Yanasse, H., Morabito, R., & Junqueira, L. (2019). A hybrid approach for a multi-compartment container loading problem. Expert Systems with Applications, 137, 471\u2013492.","journal-title":"Expert Systems with Applications"},{"key":"4349_CR42","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/j.ejor.2011.04.025","volume":"214","author":"J Ren","year":"2011","unstructured":"Ren, J., Tian, Y., & Sawaragi, T. (2011). A tree search method for the container loading problem with shipment priority. European Journal of Operational Research, 214, 526\u2013535.","journal-title":"European Journal of Operational Research"},{"key":"4349_CR43","doi-asserted-by":"crossref","unstructured":"Resende, M., & Ribeiro, C. (2019). Greedy Randomized Adaptive Search Procedures: Advances and Extensions (pp. 169\u2013220). Cham: Springer International Publishing.","DOI":"10.1007\/978-3-319-91086-4_6"},{"key":"4349_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64403-5","volume-title":"Introduction to cutting and packing optimization","author":"G Scheithauer","year":"2018","unstructured":"Scheithauer, G. (2018). Introduction to cutting and packing optimization. Newyork: Springer."},{"key":"4349_CR45","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ejor.2012.08.014","volume":"224","author":"V Schmid","year":"2013","unstructured":"Schmid, V., Doerner, K., & Laporte, G. (2013). Rich routing problems arising in supply chain management. European Journal of Operational Research, 224, 435\u2013448.","journal-title":"European Journal of Operational Research"},{"key":"4349_CR46","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1111\/itor.12099","volume":"23","author":"E Silva","year":"2016","unstructured":"Silva, E., Oliveira, J., & W\u00e4scher, G. (2016). The pallet loading problem: A review of solution methods and computational experiments. International Transactions in Operational Research, 23, 147\u2013172.","journal-title":"International Transactions in Operational Research"},{"key":"4349_CR47","doi-asserted-by":"crossref","unstructured":"Terno, J., Scheithauer, G., & Sommerwei$$\\beta $$, U., Riehme. (2000). An efficient approach for the multi-pallet loading problem. J European Journal of Operational Research,123, 372\u2013381.","DOI":"10.1016\/S0377-2217(99)00263-5"},{"key":"4349_CR48","unstructured":"Tsai, D. (1987). Modeling and analysis of three-dimensional robotic palletizing systems for mixed carton sizes. Iowa State University (Ph.D. thesis)"},{"key":"4349_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T., Gendreau, M., & Prins, C. (2013). Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. European Journal of Operational Research, 231, 1\u201321.","journal-title":"European Journal of Operational Research"},{"key":"4349_CR50","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2007.08.017","volume":"191","author":"Z Wang","year":"2008","unstructured":"Wang, Z., Li, K., & Levy, J. (2008). A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach. European Journal of Operational Research, 191, 86\u201399.","journal-title":"European Journal of Operational Research"},{"key":"4349_CR51","doi-asserted-by":"crossref","unstructured":"W\u00e4scher, G., & Hau$$\\beta $$ner, H., Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research,183, 1109\u20131130.","DOI":"10.1016\/j.ejor.2005.12.047"},{"key":"4349_CR52","doi-asserted-by":"publisher","first-page":"2267","DOI":"10.1016\/j.cor.2011.10.019","volume":"39","author":"D Zhang","year":"2012","unstructured":"Zhang, D., Peng, Y., & Leung, S. (2012). A heuristic block-loading algorithm based on multi-layer search for the container loading problem. Computers and Operations Research, 39, 2267\u20132276.","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-04349-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04349-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04349-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T17:40:31Z","timestamp":1757094031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04349-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,25]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["4349"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04349-w","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2021,10,25]]},"assertion":[{"value":"7 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}