{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T17:07:04Z","timestamp":1765040824712,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T00:00:00Z","timestamp":1543881600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10898-018-0724-0","type":"journal-article","created":{"date-parts":[[2018,12,3]],"date-time":"2018-12-03T23:13:06Z","timestamp":1543878786000},"page":"723-759","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Packing circles into perimeter-minimizing convex hulls"],"prefix":"10.1007","volume":"73","author":[{"given":"Josef","family":"Kallrath","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8300-2137","authenticated-orcid":false,"given":"Markus M.","family":"Frey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,4]]},"reference":[{"issue":"1","key":"724_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(1), 464\u2013479 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"724_CR2","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)","journal-title":"J. Global Optim."},{"key":"724_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-8118-8","volume-title":"Lectures on Sphere Arrangements\u2014the Discrete Geometric Side","author":"K Bezdek","year":"2013","unstructured":"Bezdek, K.: Lectures on Sphere Arrangements\u2014the Discrete Geometric Side, vol. 32. Springer, New York (2013)"},{"key":"724_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546587","volume-title":"Finite Packing and Covering. Cambridge Tracts in Mathematics","author":"JR B\u00f6r\u00f6czky","year":"2004","unstructured":"B\u00f6r\u00f6czky, J.R.: Finite Packing and Covering. Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge (2004)"},{"issue":"3","key":"724_CR5","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1016\/j.ejor.2007.01.054","volume":"191","author":"I Castillo","year":"2008","unstructured":"Castillo, I., Kampas, F., Pint\u00e9r, J.: Solving circle packing problems by global optimization: numerical results and industrial application. Eur. J. Oper. Res. 191(3), 786\u2013802 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"724_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2016-7","volume-title":"Sphere Packings, Lattices and Groups. A Series of Comprehensive Studies in Mathematics","author":"J Conway","year":"1988","unstructured":"Conway, J., Sloane, N.: Sphere Packings, Lattices and Groups. A Series of Comprehensive Studies in Mathematics. Springer, Berlin (1988)"},{"issue":"4","key":"724_CR7","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(4), 145\u2013159 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"724_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10589-007-9049-5","volume":"39","author":"M Hifi","year":"2008","unstructured":"Hifi, M., M\u2019Hallah, R.: Adaptive and restarting techniques-based algorithms for circular packing problems. Comput. Optim. Appl. 39, 17\u201335 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"724_CR9","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/S0377-2217(03)00417-X","volume":"159","author":"M Hifi","year":"2004","unstructured":"Hifi, M., Paschos, V., Zissimopoulos, V.: A simulated annealing approach for the circular cutting problem. Eur. J. Oper. Res. 159, 430\u2013448 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"724_CR10","first-page":"1983","volume":"33","author":"J Kallrath","year":"2009","unstructured":"Kallrath, J.: Combined strategic design and operative planning in the process industry. Comput. Chem. Eng. 33, 1983\u20131993 (2009)","journal-title":"Comput. Chem. Eng."},{"key":"724_CR11","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)","journal-title":"J. Global Optim."},{"key":"724_CR12","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s11590-011-0320-4","volume":"5","author":"J Kallrath","year":"2011","unstructured":"Kallrath, J.: Polylithic modeling and solution approaches using algebraic modeling systems. Optim. Lett. 5, 453\u2013466 (2011). \n                    https:\/\/doi.org\/10.1007\/s11590-011-0320-4","journal-title":"Optim. Lett."},{"issue":"1","key":"724_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10898-015-0348-6","volume":"67","author":"J Kallrath","year":"2017","unstructured":"Kallrath, J.: Packing ellipsoids into volume-minimizing rectangular boxes. J. Global Optim. 67(1), 151\u2013185 (2017). \n                    https:\/\/doi.org\/10.1007\/s10898-015-0348-6","journal-title":"J. Global Optim."},{"key":"724_CR14","unstructured":"Libeskind, S.: Euclidean and transformational geometry: a deductive inquiry. Jones & Bartlett Learning, LLC (2008). \n                    https:\/\/books.google.de\/books?id=JiTse0Nm_-IC"},{"key":"724_CR15","doi-asserted-by":"crossref","unstructured":"Nash, E., Pir, A., Sottile, F., Ying, L.: Convex hull of two circles in \n                    \n                      \n                    \n                    $$r^3$$\n                    \n                      \n                        \n                          r\n                          3\n                        \n                      \n                    \n                  . Tech. rep. Algebraic Geometry (2017)","DOI":"10.1007\/978-1-4939-7486-3_14"},{"issue":"3","key":"724_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0925-7721(92)90015-K","volume":"1","author":"D Rappaport","year":"1992","unstructured":"Rappaport, D.: A convex hull algorithm for discs, an application. Comput. Geom. Theory Appl. 1(3), 171\u2013187 (1992)","journal-title":"Comput. Geom. Theory Appl."},{"key":"724_CR17","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1007\/s11590-015-0937-9","volume":"10","author":"P Stetsyuk","year":"2016","unstructured":"Stetsyuk, P., Romanova, T., Scheithauer, G.: On the global minimum in a balanced circular packing problem. Optim. Lett. 10, 1347\u20131360 (2016)","journal-title":"Optim. Lett."},{"issue":"4","key":"724_CR18","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/s10898-011-9716-z","volume":"52","author":"Y Stoyan","year":"2012","unstructured":"Stoyan, Y., Yaskov, G.: Packing congruent hyperspheres into a hypersphere. J. Global Optim. 52(4), 855\u2013868 (2012)","journal-title":"J. Global Optim."},{"issue":"3","key":"724_CR19","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/s11590-013-0646-1","volume":"8","author":"Y Stoyan","year":"2014","unstructured":"Stoyan, Y., Yaskov, G.: Packing unequal circles into a strip of minimal length with a jump algorithm. Optim. Lett. 8(3), 949\u2013970 (2014). \n                    https:\/\/doi.org\/10.1007\/s11590-013-0646-1","journal-title":"Optim. Lett."},{"key":"724_CR20","unstructured":"Thue, A.: \u00dcber die dichteste Zusammenstellung von kongruenten Kreisen in einer Ebene. J. Dybwad (1910). \n                    https:\/\/books.google.de\/books?id=IUJyQwAACAAJ"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0724-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0724-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0724-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T19:07:27Z","timestamp":1575400047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0724-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,4]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["724"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0724-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2018,12,4]]},"assertion":[{"value":"9 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}