{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T19:20:05Z","timestamp":1771788005202,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T00:00:00Z","timestamp":1633996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T00:00:00Z","timestamp":1633996800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA8655-20-1-7012"],"award-info":[{"award-number":["FA8655-20-1-7012"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005639","name":"Universidade de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2017\/11831-1"],"award-info":[{"award-number":["2017\/11831-1"]}],"id":[{"id":"10.13039\/501100005639","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Two-dimensional cutting and packing problems model a large number of relevant industrial applications.The literature on practical algorithms for such problems is very large. We introduce the , a library on two-dimensional orthogonal cutting and packing problems. The library makes available, in a unified format, 25 benchmarks from the literature for a total of over 3000 instances, provides direct links to surveys and typologies, and includes a list of relevant links.<\/jats:p>","DOI":"10.1007\/s11590-021-01808-y","type":"journal-article","created":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T01:57:39Z","timestamp":1634090259000},"page":"471-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["2DPackLib: a two-dimensional cutting and packing library"],"prefix":"10.1007","volume":"16","author":[{"given":"Manuel","family":"Iori","sequence":"first","affiliation":[]},{"given":"Vin\u00edcius Loti","family":"de Lima","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6515-1406","authenticated-orcid":false,"given":"Silvano","family":"Martello","sequence":"additional","affiliation":[]},{"given":"Michele","family":"Monaci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,12]]},"reference":[{"key":"1808_CR1","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes, R., Carravilla, M., Oliveira, J.: Cutting and packing. In: Mart\u00ed, R., Pardalos, P., Resende, M. (eds.) Handbook of Heuristics, pp. 931\u2013977. Springer (2018)","DOI":"10.1007\/978-3-319-07124-4_43"},{"issue":"7","key":"1808_CR2","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1016\/S0305-0548(00)00095-2","volume":"29","author":"R Alvarez-Vald\u00e9s","year":"2002","unstructured":"Alvarez-Vald\u00e9s, R., Paraj\u00f3n, A., Tamarit, J.: A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Comput. Oper. Res. 29(7), 925\u2013947 (2002)","journal-title":"Comput. Oper. Res."},{"key":"1808_CR3","volume-title":"The Traveling Salesman Problem\u2014A Computational Study","author":"D Applegate","year":"2006","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, W.: The Traveling Salesman Problem\u2014A Computational Study. Princeton University Press, Princeton (2006)"},{"issue":"4","key":"1808_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1057\/jors.1985.51","volume":"36","author":"J Beasley","year":"1985","unstructured":"Beasley, J.: Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. 36(4), 297\u2013306 (1985)","journal-title":"J. Oper. Res. Soc."},{"key":"1808_CR5","doi-asserted-by":"crossref","unstructured":"Beasley, J.: An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. 33(1), 49\u201364 (1985)","DOI":"10.1287\/opre.33.1.49"},{"issue":"11","key":"1808_CR6","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J Beasley","year":"1990","unstructured":"Beasley, J.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"1808_CR7","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/S0377-2217(03)00139-5","volume":"156","author":"J Beasley","year":"2004","unstructured":"Beasley, J.: A population heuristic for constrained two-dimensional non-guillotine cutting. Eur. J. Oper. Res.D 156(3), 601\u2013627 (2004)","journal-title":"Eur. J. Oper. Res.D"},{"key":"1808_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1093\/comjnl\/25.3.353","volume":"25","author":"BE Bengtsson","year":"1982","unstructured":"Bengtsson, B.E.: Packing rectangular pieces\u2014a heuristic approach. Comput. J. 25, 353\u2013357 (1982)","journal-title":"Comput. J."},{"key":"1808_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"JO Berkey","year":"1987","unstructured":"Berkey, J.O., Wang, P.Y.: Two dimensional finite bin packing algorithms. J. Oper. Res. Soc. 38, 423\u2013429 (1987)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"1808_CR10","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1080\/01605682.2019.1578914","volume":"71","author":"V Bezerra","year":"2020","unstructured":"Bezerra, V., Leao, A., Oliveira, J., Santos, M.: Models for the two-dimensional level strip packing problem\u2014a review and a computational evaluation. J. Oper. Res. Soc. 71(4), 606\u2013627 (2020)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"1808_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0377-2217(91)90197-4","volume":"55","author":"R Burkard","year":"1991","unstructured":"Burkard, R., Karisch, S., Rendl, F.: QAPLIB- a quadratic assignment problem library. Eur. J. Oper. Res. 55(1), 115\u2013119 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"1808_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R Burkard","year":"1997","unstructured":"Burkard, R., Karisch, S., Rendl, F.: QAPLIB - a quadratic assignment problem library. J. Global Optim. 10, 391\u2013403 (1997)","journal-title":"J. Global Optim."},{"issue":"4","key":"1808_CR13","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.: A new placement heuristic for the orthogonal stock-cutting problem. Oper. Res. 52(4), 655\u2013671 (2004)","journal-title":"Oper. Res."},{"key":"1808_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cosrev.2016.12.001","volume":"24","author":"HI Christensen","year":"2017","unstructured":"Christensen, H.I., Khan, A., Pokutta, S., Tetali, P.: Approximation and online algorithms for multidimensional bin packing: a survey. Comput. Sci. Rev. 24, 63\u201379 (2017)","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"1808_CR15","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N Christofides","year":"1977","unstructured":"Christofides, N., Whitlock, C.: An algorithm for two-dimensional cutting problems. Oper. Res. 25(1), 30\u201344 (1977)","journal-title":"Oper. Res."},{"issue":"3","key":"1808_CR16","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1016\/j.cor.2006.05.012","volume":"35","author":"F Clautiaux","year":"2008","unstructured":"Clautiaux, F., Jouglet, A., Carlier, J., Moukrim, A.: A new constraint programming approach for the orthogonal packing problem. Comput. Oper. Res. 35(3), 944\u2013959 (2008)","journal-title":"Comput. Oper. Res."},{"key":"1808_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.cie.2017.06.036","volume":"111","author":"G Costa","year":"2017","unstructured":"Costa, G., Delorme, M., Iori, M., Malaguti, E., Martello, S.: Training software for orthogonal packing problems. Comput. Ind. Eng. 111, 139\u2013147 (2017)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"1808_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s11590-017-1192-z","volume":"12","author":"M Delorme","year":"2018","unstructured":"Delorme, M., Iori, M., Martello, S.: BPPLIB: a library for bin packing and cutting stock problems. Optim. Lett. 12(2), 235\u2013250 (2018)","journal-title":"Optim. Lett."},{"issue":"2","key":"1808_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H Dyckhoff","year":"1990","unstructured":"Dyckhoff, H.: A typology of cutting and packing problems. Eur. J. Oper. Res. 44(2), 145\u2013159 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"1808_CR20","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1057\/palgrave.jors.2600638","volume":"49","author":"D Fayard","year":"1998","unstructured":"Fayard, D., Hifi, M., Zissimopoulos, V.: An efficient approach for large-scale two-dimensional guillotine cutting stock problems. J. Oper. Res. Soc. 49(12), 1270\u20131277 (1998)","journal-title":"J. Oper. Res. Soc."},{"key":"1808_CR21","doi-asserted-by":"crossref","unstructured":"Fekete, S., Schepers, J.: A new exact algorithm for general orthogonal d-dimensional knapsack problems. In: Burkard, R., Woeginger, G. (eds.) Algorithms - ESA, vol. 1284, pp. 144\u2013156. Springer (1997)","DOI":"10.1007\/3-540-63397-9_12"},{"key":"1808_CR22","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s12532-010-0013-5","volume":"2","author":"C Gro\u00ebr","year":"2010","unstructured":"Gro\u00ebr, C., Golden, B., Wasil, E.: A library of local search heuristics for the vehicle routing problem. Math. Programm. Comput. 2, 79\u2013101 (2010)","journal-title":"Math. Programm. Comput."},{"key":"1808_CR23","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1008743711658","volume":"18","author":"M Hifi","year":"2001","unstructured":"Hifi, M.: Exact algorithms for large-scale unconstrained two and three staged cutting problems. Combinatorial Optim. Appl. 18, 63\u201388 (2001)","journal-title":"Combinatorial Optim. Appl."},{"issue":"1","key":"1808_CR24","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E Hopper","year":"2001","unstructured":"Hopper, E., Turton, B.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur. J. Oper. Res. 128(1), 34\u201357 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"1808_CR25","first-page":"123","volume":"2","author":"E Hopper","year":"2002","unstructured":"Hopper, E., Turton, B.: Problem generators for rectangular packing problems. Stud. Inform. Univ. 2, 123\u2013136 (2002)","journal-title":"Stud. Inform. Univ."},{"issue":"2","key":"1808_CR26","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.ejor.2020.06.050","volume":"289","author":"M Iori","year":"2021","unstructured":"Iori, M., de Lima, V., Martello, S., Miyazawa, F., Monaci, M.: Exact solution techniques for two-dimensional cutting and packing. Eur. J. Oper. Res. 289(2), 399\u2013415 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"1808_CR27","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R., Danna, E., Gamrath, G., Gleixner, A., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3, 103 (2011)","journal-title":"Math. Program. Comput."},{"issue":"10","key":"1808_CR28","doi-asserted-by":"publisher","first-page":"13032","DOI":"10.1016\/j.eswa.2011.04.105","volume":"38","author":"S Leung","year":"2011","unstructured":"Leung, S., Zhang, D.: A fast layer-based heuristic for non-guillotine strip packing. Expert Syst. Appl. 38(10), 13032\u201313042 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"1808_CR29","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141(2), 241\u2013252 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"1808_CR30","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/9781119005353.ch5","volume-title":"Paradigms of Combinatorial Optimization: Problems and New Approaches","author":"A Lodi","year":"2014","unstructured":"Lodi, A., Martello, S., Monaci, M., Vigo, D.: Two-dimensional bin packing problems. In: Paschos, V.T. (ed.) Paradigms of Combinatorial Optimization: Problems and New Approaches, pp. 107\u2013129. Wiley, Hoboken (2014)"},{"issue":"4","key":"1808_CR31","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A Lodi","year":"1999","unstructured":"Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. 11(4), 345\u2013357 (1999)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"1808_CR32","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","volume":"123","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discrete Appl. Math. 123(1), 379\u2013396 (2002)","journal-title":"Discrete Appl. Math."},{"key":"1808_CR33","doi-asserted-by":"crossref","unstructured":"Macedo, R., Alves, C., Val\u00e9rio de Carvalho, J.: Arc-flow model for the two-dimensional guillotine cutting stock problem. Comput. Oper. Res. 37(6), 991\u20131001 (2010)","DOI":"10.1016\/j.cor.2009.08.005"},{"issue":"3","key":"1808_CR34","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","volume":"15","author":"S Martello","year":"2003","unstructured":"Martello, S., Monaci, M., Vigo, D.: An exact approach to the strip-packing problem. INFORMS J. Comput. 15(3), 310\u2013319 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"1808_CR35","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Manag. Sci. 44(3), 388\u2013399 (1998)","journal-title":"Manag. Sci."},{"issue":"10","key":"1808_CR36","doi-asserted-by":"publisher","first-page":"2425","DOI":"10.1016\/j.cor.2011.12.010","volume":"39","author":"M Mesyagutov","year":"2012","unstructured":"Mesyagutov, M., Scheithauer, G., Belov, G.: LP bounds in various constraint programming approaches for orthogonal packing. Comput. Oper. Res. 39(10), 2425\u20132438 (2012)","journal-title":"Comput. Oper. Res."},{"key":"1808_CR37","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10479-008-0457-4","volume":"179","author":"R Morabito","year":"2010","unstructured":"Morabito, R., Pureza, V.: A heuristic approach based on dynamic programming and and\/or-graph search for the constrained two-dimensional guillotine cutting problem. Ann. Oper. Res. 179, 297\u2013315 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"1808_CR38","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.disopt.2008.11.002","volume":"6","author":"N Ntene","year":"2009","unstructured":"Ntene, N., van Vuuren, J.: A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem. Discrete Optim. 6(2), 174\u2013188 (2009)","journal-title":"Discrete Optim."},{"issue":"2","key":"1808_CR39","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0377-2217(90)90361-E","volume":"44","author":"J Oliveira","year":"1990","unstructured":"Oliveira, J., Ferreira, J.: An improved version of Wangs algorithm for two-dimensional cutting problems. Eur. J. Oper. Res. 44(2), 256\u2013266 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1808_CR40","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1590\/0101-7438.2016.036.02.0197","volume":"36","author":"J Oliveira","year":"2016","unstructured":"Oliveira, J., J\u00fanior, A.N., Silva, E., Carravilla, M.: A survey on heuristics for the two-dimensional rectangular strip packing problem. Pesquisa Operacional 36(2), 197\u2013226 (2016)","journal-title":"Pesquisa Operacional"},{"issue":"2","key":"1808_CR41","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1111\/itor.12687","volume":"27","author":"M Russo","year":"2020","unstructured":"Russo, M., Boccia, M., Sforza, A., Sterle, C.: Constrained two-dimensional guillotine cutting problem: upper-bound review and categorization. Int. Trans. Oper. Res. 27(2), 794\u2013834 (2020)","journal-title":"Int. Trans. Oper. Res."},{"key":"1808_CR42","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cor.2014.04.001","volume":"50","author":"M Russo","year":"2014","unstructured":"Russo, M., Sforza, A., Sterle, C.: An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems. Comput. Oper. Res. 50, 97\u2013114 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1808_CR43","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1016\/j.ejor.2014.02.059","volume":"237","author":"E Silva","year":"2014","unstructured":"Silva, E., Oliveira, J., W\u00e4scher, G.: 2DCPackGen: A problem generator for two-dimensional rectangular cutting and packing problems. Eur. J. Oper. Res. 237(3), 846\u2013856 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"1808_CR44","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.: The pallet loading problem: a review of solution methods and computational experiments. Int. Trans. Oper. Res. 23(1\u20132), 147\u2013172 (2016)","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"1808_CR45","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3), 845\u2013858 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1808_CR46","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ejor.2018.06.016","volume":"272","author":"A Velasco","year":"2019","unstructured":"Velasco, A., Uchoa, E.: Improved state space relaxation for constrained two-dimensional guillotine cutting problems. Eur. J. Oper. Res. 272(1), 106\u2013120 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1808_CR47","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.31.3.573","volume":"31","author":"P Wang","year":"1983","unstructured":"Wang, P.: Two algorithms for constrained two-dimensional cutting stock problems. Oper. Res. 31(3), 573\u2013586 (1983)","journal-title":"Oper. Res."},{"issue":"3","key":"1808_CR48","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hau\u00dfner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01808-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01808-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01808-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T15:09:28Z","timestamp":1706195368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01808-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,12]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1808"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01808-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,12]]},"assertion":[{"value":"17 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The datasets generated during and\/or analyzed during the current study are available in the 2DPackLib repository, .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data availability"}}]}}