{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T06:41:47Z","timestamp":1781678507373,"version":"3.54.5"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T00:00:00Z","timestamp":1664064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T00:00:00Z","timestamp":1664064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10898-022-01194-4","type":"journal-article","created":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T02:02:19Z","timestamp":1664071339000},"page":"39-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Packing convex polygons in minimum-perimeter convex hulls"],"prefix":"10.1007","volume":"85","author":[{"given":"Josef","family":"Kallrath","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tatiana","family":"Romanova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Pankratov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Igor","family":"Litvinchev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luis","family":"Infante","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,25]]},"reference":[{"key":"1194_CR1","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/s00453-010-9466-1","volume":"62","author":"HK Ahn","year":"2012","unstructured":"Ahn, H.K., Cheong, O.: Aligning two convex figures to minimize area or perimeter. Algorithmica 62, 464\u2013479 (2012). https:\/\/doi.org\/10.1007\/s00453-010-9466-1","journal-title":"Algorithmica"},{"key":"1194_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_3","volume-title":"Algorithms\u2014ESA 2015. Lecture Notes in Computer Science","author":"H Alt","year":"2015","unstructured":"Alt, H., de Berg, M., Knauer, C.: Approximating minimum-area rectangular and convex containers for packing convex polygons. In: Bansal, N., Finocchi, I. (eds.) Algorithms\u2014ESA 2015. Lecture Notes in Computer Science, vol. 9294. Springer, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_3"},{"issue":"18","key":"1194_CR3","doi-asserted-by":"publisher","first-page":"5920","DOI":"10.1080\/00207543.2018.1534016","volume":"57","author":"LJP Ara\u00fajo","year":"2019","unstructured":"Ara\u00fajo, L.J.P., \u00d6zcan, E., Atkin, J.A.D., Baumers, M.: Analysis of irregular three-dimensional packing problems in additive manufacturing: a new taxonomy and dataset. Int. J. Prod. Res. 57(18), 5920\u20135934 (2019). https:\/\/doi.org\/10.1080\/00207543.2018.1534016","journal-title":"Int. J. Prod. Res."},{"issue":"5\u20136","key":"1194_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0925-7721(96)00023-5","volume":"7","author":"D Avis","year":"1997","unstructured":"Avis, D., Bremner, D., Seidel, R.: How good are convex hull algorithms? Comput. Geom. Theory Appl. 7(5\u20136), 265\u2013301 (1997). https:\/\/doi.org\/10.1016\/S0925-7721(96)00023-5","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"1194_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ejor.2006.11.038","volume":"184","author":"JA Bennell","year":"2008","unstructured":"Bennell, J.A., Oliveira, J.F.: The geometry of nesting problems: a tutorial. Eur. J. Oper. Res. 184(2), 397\u2013415 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2006.11.038","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1194_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1057\/jors.2008.169","volume":"60","author":"JA Bennell","year":"2009","unstructured":"Bennell, J.A., Oliveira, J.F.: A tutorial in irregular shape packing problems. J. Oper. Res. Soc. 60(1), 93\u2013105 (2009). https:\/\/doi.org\/10.1057\/jors.2008.169","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"1194_CR7","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10898-014-0192-0","volume":"61","author":"J Bennell","year":"2015","unstructured":"Bennell, J., Scheithauer, G., Stoyan, Y., Romanova, T., Pankratov, A.: Optimal clustering of a pair of irregular objects. J. Global Optim. 61(3), 497\u2013524 (2015). https:\/\/doi.org\/10.1007\/s10898-014-0192-0","journal-title":"J. Global Optim."},{"key":"1194_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry Algorithms and Applications","author":"M De Berg","year":"2008","unstructured":"De Berg, M., Otfried, C., Marc, V.K., Mark, O.: Computational Geometry Algorithms and Applications, pp. 2\u201314. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2"},{"issue":"5","key":"1194_CR9","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.comgeo.2009.12.003","volume":"43","author":"N Chernov","year":"2010","unstructured":"Chernov, N., Stoyan, Y., Romanova, T.: Mathematical model and efficient algorithms for object packing problem. Comput. Geom. Theory Appl. 43(5), 535\u2013553 (2010). https:\/\/doi.org\/10.1016\/j.comgeo.2009.12.003","journal-title":"Comput. Geom. Theory Appl."},{"key":"1194_CR10","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn. MIT Press and McGraw-Hill (2001). ISBN\u00a00-262-03293-7. Section 33.3: Finding the convex hull, 947\u2013957"},{"issue":"11","key":"1194_CR11","doi-asserted-by":"publisher","first-page":"4239","DOI":"10.1073\/pnas.1213237110","volume":"110","author":"E Dumonteil","year":"2013","unstructured":"Dumonteil, E., Majumdar, S.N., Rosso, A., Zoia, A.: Spatial extent of an outbreak in animal epidemics. Proc. Natl. Acad. Sci. USA 110(11), 4239\u20134244 (2013). https:\/\/doi.org\/10.1073\/pnas.1213237110","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"1194_CR12","doi-asserted-by":"publisher","unstructured":"Fasano, G.: Non-standard packing problems: a modelling-based approach. In: Solving Non-standard Packing Problems by Global Optimization and Heuristics. Springer Briefs in Optimization. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05005-8_1","DOI":"10.1007\/978-3-319-05005-8_1"},{"key":"1194_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-020-00577-8","author":"I Gimenez-Palacios","year":"2020","unstructured":"Gimenez-Palacios, I., Alonso, M.T., Alvarez-Valdes, R., Parre\u00f1o, F.: Logistic constraints in container loading problems: the impact of complete shipment conditions. TOP (2020). https:\/\/doi.org\/10.1007\/s11750-020-00577-8","journal-title":"TOP"},{"issue":"2","key":"1194_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10559-018-0023-2","volume":"54","author":"IV Grebennik","year":"2018","unstructured":"Grebennik, I.V., Kovalenko, A.A., Romanova, T.E., Urniaieva, I.A., Shekhovtsov, S.B.: Combinatorial configurations in balance layout optimization problems. Cybern. Syst. Anal. 54(2), 221\u2013231 (2018). https:\/\/doi.org\/10.1007\/s10559-018-0023-2","journal-title":"Cybern. Syst. Anal."},{"key":"1194_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10898-013-0129-z","volume":"59","author":"DR Jones","year":"2013","unstructured":"Jones, D.R.: A fully general, exact algorithm for nesting irregular shapes. J. Global Optim. 59, 367\u2013404 (2013). https:\/\/doi.org\/10.1007\/s10898-013-0129-z","journal-title":"J. Global Optim."},{"key":"1194_CR16","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10898-007-9274-6","volume":"43","author":"J Kallrath","year":"2009","unstructured":"Kallrath, J.: Cutting circles and polygons from area-minimizing rectangles. J. Global Optim. 43, 299\u2013328 (2009). https:\/\/doi.org\/10.1007\/s10898-007-9274-6","journal-title":"J. Global Optim."},{"key":"1194_CR17","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s10013-018-0317-8","volume":"46","author":"J Kallrath","year":"2018","unstructured":"Kallrath, J., Frey, M.M.: Minimal surface convex hulls of spheres. Vietnam J. Math. 46, 883\u2013913 (2018). https:\/\/doi.org\/10.1007\/s10013-018-0317-8","journal-title":"Vietnam J. Math."},{"issue":"4","key":"1194_CR18","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s10898-018-0724-0","volume":"73","author":"J Kallrath","year":"2019","unstructured":"Kallrath, J., Frey, M.M.: Packing circles into perimeter-minimizing convex hulls. J. Global Optim. 73(4), 723\u2013759 (2019). https:\/\/doi.org\/10.1007\/s10898-018-0724-0","journal-title":"J. Global Optim."},{"key":"1194_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66616-7_2","volume-title":"Modeling and Optimization: Theory and Applications. MOPTA 2016. Springer Proceedings in Mathematics & Statistics","author":"FJ Kampas","year":"2017","unstructured":"Kampas, F.J., Pint\u00e9r, J.D., Castillo, I.: Optimal packing of general ellipses in a circle. In: Tak\u00e1\u010d, M., Terlaky, T. (eds.) Modeling and Optimization: Theory and Applications. MOPTA 2016. Springer Proceedings in Mathematics & Statistics, vol. 213. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66616-7_2"},{"issue":"7","key":"1194_CR20","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1007\/s11590-019-01423-y","volume":"13","author":"FJ Kampas","year":"2019","unstructured":"Kampas, F.J., Castillo, I., Pint\u00e9r, J.D.: Optimized ellipse packings in regular polygons. Optim. Lett. 13(7), 1583\u20131613 (2019). https:\/\/doi.org\/10.1007\/s11590-019-01423-y","journal-title":"Optim. Lett."},{"key":"1194_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10898-019-00824-8","volume":"77","author":"FJ Kampas","year":"2020","unstructured":"Kampas, F.J., Pint\u00e9r, J.D., Castillo, I.: Packing ovals in optimized regular polygons. J. Glob. Optim. 77, 175\u2013196 (2020)","journal-title":"J. Glob. Optim."},{"key":"1194_CR22","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10, 383\u2013421 (2018)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"1194_CR23","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.ejor.2019.04.045","volume":"282","author":"AAS Leao","year":"2020","unstructured":"Leao, A.A.S., Toledo, F.M.B., Oliveira, J.F., Carravilla, M.A., Alvarez-Vald\u00e9s, R.: Irregular packing problems: a review of mathematical models. Eur. J. Oper. Res. 282(3), 803\u2013822 (2020). https:\/\/doi.org\/10.1016\/j.ejor.2019.04.045","journal-title":"Eur. J. Oper. Res."},{"issue":"10\u201311","key":"1194_CR24","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/S0305-0548(99)00027-1","volume":"26","author":"I Litvinchev","year":"1999","unstructured":"Litvinchev, I., Rangel, S.: Localization of the optimal solution and a posteriori bounds for aggregation. Comput. Oper. Res. 26(10\u201311), 967\u2013988 (1999)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"1194_CR25","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1016\/j.camwa.2010.03.070","volume":"60","author":"I Litvinchev","year":"2010","unstructured":"Litvinchev, I., Mata, M., Rangel, S., Saucedo, J.: Lagrangian heuristic for a class of the generalized assignment problems. Comput. Math. Appl. 60(4), 1115\u20131123 (2010)","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"1194_CR26","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10898-019-00777-y","volume":"75","author":"A Pankratov","year":"2019","unstructured":"Pankratov, A., Romanova, T., Litvinchev, I.: Packing ellipses in an optimized convex polygon. J. Global Optim. 75(2), 495\u2013522 (2019)","journal-title":"J. Global Optim."},{"issue":"7","key":"1194_CR27","doi-asserted-by":"publisher","first-page":"4869","DOI":"10.1007\/s11276-018-1890-1","volume":"26","author":"A Pankratov","year":"2020","unstructured":"Pankratov, A., Romanova, T., Litvinchev, I.: Packing ellipses in an optimized rectangular container. Wirel. Netw. 26(7), 4869\u20134879 (2020)","journal-title":"Wirel. Netw."},{"key":"1194_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2015.10.003","volume":"51","author":"D Park","year":"2016","unstructured":"Park, D., Bae, S.W., Alt, H., Ahn, H.K.: Bundling three convex polygons to minimize area or perimeter. Comput. Geom. 51, 1\u201314 (2016). https:\/\/doi.org\/10.1016\/j.comgeo.2015.10.003","journal-title":"Comput. Geom."},{"key":"1194_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)"},{"key":"1194_CR30","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ejor.2018.01.025","volume":"268","author":"T Romanova","year":"2018","unstructured":"Romanova, T., Bennell, J., Stoyan, Y., et al.: Packing of concave polyhedra with continuous rotations using nonlinear optimisation. Eur. J. Oper. Res. 268, 37\u201353 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"1194_CR31","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.ejor.2020.01.051","volume":"285","author":"T Romanova","year":"2020","unstructured":"Romanova, T., Litvinchev, I., Pankratov, A.: Packing ellipsoids in an optimized cylinder. Eur. J. Oper. Res. 285, 429\u2013443 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"1194_CR32","unstructured":"Sahinidis, N.V.: BARON 19.12.7: global optimization of mixed-integer nonlinear programs, User's manual (2019)"},{"key":"1194_CR33","doi-asserted-by":"crossref","unstructured":"Scheithauer, G.: Introduction to Cutting and Packing Optimization. Problems, Modeling Approaches, Solution Methods. Springer, Cham (2018). ISBN 978-3-319-64403-5","DOI":"10.1007\/978-3-319-64403-5"},{"issue":"2","key":"1194_CR34","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10898-015-0331-2","volume":"65","author":"Yu Stoyan","year":"2016","unstructured":"Stoyan, Yu., Pankratov, A., Romanova, T.: Quasi-phi-functions and optimal packing of ellipses. J. Global Optim. 65(2), 283\u2013307 (2016). https:\/\/doi.org\/10.1007\/s10898-015-0331-2","journal-title":"J. Global Optim."},{"key":"1194_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68640-0_25","volume-title":"Optimization Methods and Applications. Springer Optimization and Its Applications","author":"Y Stoyan","year":"2017","unstructured":"Stoyan, Y., Pankratov, A., Romanova, T.: Placement problems for irregular objects: mathematical modeling, optimization and applications. In: Butenko, S., Pardalos, P., Shylo, V. (eds.) Optimization Methods and Applications. Springer Optimization and Its Applications, vol. 130. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68640-0_25"},{"key":"1194_CR36","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-10501-3_15","volume-title":"Modeling and Optimization in Space Engineering. Springer Optimization and Its Applications","author":"Y Stoyan","year":"2019","unstructured":"Stoyan, Y., Pankratov, A., Romanova, G., Fasano, J., Pinter, T., Stoian, Y.E., Chugay, A.: Optimized packings in space engineering applications: part I. In: Fasano, G., Pint\u00e9r, J. (eds.) Modeling and Optimization in Space Engineering. Springer Optimization and Its Applications, vol. 144, pp. 395\u2013437. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10501-3_15"},{"issue":"1","key":"1194_CR37","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1142\/S0218195906001926","volume":"16","author":"K Tang","year":"2006","unstructured":"Tang, K., Wang, C.C.L., Chen, D.Z.: Minimum area convex packing of two convex polygons. Int. J. Comput. Geom. Appl. 16(1), 41\u201374 (2006). https:\/\/doi.org\/10.1142\/S0218195906001926","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"1194_CR38","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005). https:\/\/doi.org\/10.1007\/s10107-005-0581-8","journal-title":"Math. Program."},{"issue":"7","key":"1194_CR39","doi-asserted-by":"publisher","first-page":"4743","DOI":"10.1007\/s11276-018-1869-y","volume":"26","author":"R Torres-Escobar","year":"2020","unstructured":"Torres-Escobar, R., Marmolejo-Saucedo, J.A., Litvinchev, I.: Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container. Wirel. Netw. 26(7), 4743\u20134752 (2020)","journal-title":"Wirel. Netw."},{"issue":"1","key":"1194_CR40","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006). https:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."},{"issue":"2","key":"1194_CR41","first-page":"773","volume":"9","author":"A Warade","year":"2020","unstructured":"Warade, A., Mulay, P., Chaudhari, A.: Packing irregular shapes for three-dimensional printing: a bibliographical study. Int. J. Sci. Tech. Res. 9(2), 773\u2013779 (2020)","journal-title":"Int. J. Sci. Tech. Res."},{"issue":"3","key":"1194_CR42","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). https:\/\/doi.org\/10.1016\/j.ejor.2005.12.047","journal-title":"Eur. J. Oper. Res."},{"key":"1194_CR43","unstructured":"Yagiura, M., Umetani, S., Imahori, S.: Cutting and Packing Problems. From the Perspective of Combinatorial Optimization. Springer, Berlin (2021). ISBN 978-4-431-55291-8"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01194-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01194-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01194-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T08:09:14Z","timestamp":1673078954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01194-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,25]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1194"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01194-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,25]]},"assertion":[{"value":"19 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}