{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:38Z","timestamp":1740123698804,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T00:00:00Z","timestamp":1704758400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T00:00:00Z","timestamp":1704758400000},"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":["Mobile Netw Appl"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s11036-023-02286-5","type":"journal-article","created":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T18:01:41Z","timestamp":1704823301000},"page":"211-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Packing Soft Convex Polygons in an Optimized Convex Container"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1850-4755","authenticated-orcid":false,"given":"Igor","family":"Litvinchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7498-6525","authenticated-orcid":false,"given":"Luis","family":"Infante","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8618-4917","authenticated-orcid":false,"given":"Tetyana","family":"Romanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Martinez-Noa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Gutierrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,9]]},"reference":[{"key":"2286_CR1","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G Wascher","year":"2007","unstructured":"Wascher G, Hau\u00dfner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183:1109\u20131130","journal-title":"Eur J Oper Res"},{"key":"2286_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10898-022-01194-4","volume":"85","author":"J Kallrath","year":"2023","unstructured":"Kallrath J, Romanova T, Pankratov A, Litvinchev I, Infante L (2023) Packing convex polygons in minimum-perimeter convex hulls. J Global Optim 85:39\u201359. https:\/\/doi.org\/10.1007\/s10898-022-01194-4","journal-title":"J Global Optim"},{"key":"2286_CR3","doi-asserted-by":"publisher","unstructured":"Zuo Q, Liu X, Xu L, Xiao L, Xu C, Liu J, Chan WKV (2022) The three-dimensional bin packing problem for deformable items. 2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Kuala Lumpur, Malaysia. pp 0911\u20130918. https:\/\/doi.org\/10.1109\/IEEM55944.2022.9989600","DOI":"10.1109\/IEEM55944.2022.9989600"},{"key":"2286_CR4","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-031-15644-1_29","volume-title":"City, society, and digital transformation. INFORMS-CSS 2022 lecture notes in operations research","author":"Q Zuo","year":"2022","unstructured":"Zuo Q, Liu X, Chan WKV (2022) A constructive heuristic algorithm for 3D bin packing of irregular shaped items. In: Qiu R, Chan WKV, Chen W, Badr Y, Zhang C (eds) City, society, and digital transformation. INFORMS-CSS 2022 lecture notes in operations research. Springer, Cham, pp 393\u2013406. https:\/\/doi.org\/10.1007\/978-3-031-15644-1_29"},{"issue":"3","key":"2286_CR5","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1109\/TMECH.2022.3223990","volume":"28","author":"W Ma","year":"2023","unstructured":"Ma W, Zhang B, Han L, Huo S, Wang H, Navarro-Alarcon D (2023) Action planning for packing long linear elastic objects into compact boxes with bimanual robotic manipulation. IEEE\/ASME Trans Mechatron 28(3):1718\u20131729. https:\/\/doi.org\/10.1109\/TMECH.2022.3223990","journal-title":"IEEE\/ASME Trans Mechatron"},{"issue":"11","key":"2286_CR6","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1080\/02331934.2012.728217","volume":"63","author":"A F\u00fcgenschuh","year":"2014","unstructured":"F\u00fcgenschuh A, Junosza-Szaniawski K, Lonc Z (2014) Exact and approximation algorithms for a soft rectangle packing problem. Optimization 63(11):1637\u20131663","journal-title":"Optimization"},{"key":"2286_CR7","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.cor.2017.05.009","volume":"86","author":"P Ji","year":"2017","unstructured":"Ji P, He K, Jin Y, Lan H, Li C (2017) An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules. Comput Oper Res 86:110\u2013123","journal-title":"Comput Oper Res"},{"key":"2286_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.comgeo.2018.01.005","volume":"70","author":"U Brenner","year":"2018","unstructured":"Brenner U (2018) \u03b3 -Soft packings of rectangles. Comput Geom 70:49\u201364","journal-title":"Comput Geom"},{"key":"2286_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10898-019-00741-w","volume":"74","author":"QT Bui","year":"2019","unstructured":"Bui QT, Vida T, H\u00e0 MH (2019) On three soft rectangle packing problems with guillotine constraints. J Glob Optim 74:45\u201362","journal-title":"J Glob Optim"},{"key":"2286_CR10","doi-asserted-by":"publisher","DOI":"10.1201\/9780429092114","volume-title":"Columnar structures of spheres: Fundamentals and applications","author":"J Winkelmann","year":"2023","unstructured":"Winkelmann J, Chan HK (2023) Columnar structures of spheres: Fundamentals and applications. Jenny Stanford Publishing, NY. https:\/\/doi.org\/10.1201\/9780429092114"},{"key":"2286_CR11","unstructured":"Winkelmann J (2020) Structures of columnar packings with soft and hard spheres, PhD Thesis, School of Physics, Trinity College Dublin"},{"key":"2286_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1088\/978-0-7503-4801-0ch9","volume-title":"Human assisted intelligent computing: modelling, simulations and applications, chapter 9","author":"T Romanova","year":"2023","unstructured":"Romanova T, Stoyan Yu, Pankratov A, Litvinchev I, Kravchenko O, Duryagina Z, Melashenko O, Chugai A (2023) Optimized packing soft ellipses. In: Manshahia MS, Litvinchev I, Thomas JJ, Vasant P, Weber WG (eds) Human assisted intelligent computing: modelling, simulations and applications, chapter 9. IOP, United Kingdom, pp 1\u201316. https:\/\/doi.org\/10.1088\/978-0-7503-4801-0ch9"},{"key":"2286_CR13","doi-asserted-by":"publisher","first-page":"108898","DOI":"10.1016\/j.cie.2022.108898","volume":"175","author":"JPL Coutinho","year":"2023","unstructured":"Coutinho JPL, Reis MS, Gon\u00e7alves Neves DFM, Bernardo FP (2023) Robust optimization and data-driven modeling of tissue paper packing considering cargo deformation. Comput Ind Eng 175:108898. https:\/\/doi.org\/10.1016\/j.cie.2022.108898","journal-title":"Comput Ind Eng"},{"key":"2286_CR14","doi-asserted-by":"publisher","first-page":"3282","DOI":"10.1007\/s11538-019-00577-1","volume":"81","author":"J Jiang","year":"2019","unstructured":"Jiang J, Garikipati K, Rudraraju S (2019) A diffuse interface framework for modeling the evolution of multi-cell aggregates as a soft packing problem driven by the growth and division of cells. Bull Math Biol 81:3282\u20133300","journal-title":"Bull Math Biol"},{"key":"2286_CR15","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1007\/s11440-019-00844-4","volume":"14","author":"Q Yuan","year":"2019","unstructured":"Yuan Q, Li Z, Gao Y, Wang YH, Li X (2019) Local responses in 2D assemblies of elliptical rods when subjected to biaxial shearing. Acta Geotech 14:1685\u20131697","journal-title":"Acta Geotech"},{"key":"2286_CR16","doi-asserted-by":"publisher","first-page":"2963","DOI":"10.1039\/d0sm01699c","volume":"17","author":"Y Chen","year":"2021","unstructured":"Chen Y, Yuan M, Wang Z, Zhao Y, Li J, Hu B, Xia C (2021) Structural characterization and statistical properties of jammed soft ellipsoid packing. Soft Matter 17:2963. https:\/\/doi.org\/10.1039\/d0sm01699c","journal-title":"Soft Matter"},{"key":"2286_CR17","doi-asserted-by":"publisher","first-page":"128833","DOI":"10.1016\/j.physa.2023.128833","volume":"623","author":"R Guo","year":"2023","unstructured":"Guo R, Li J, Ai B (2023) Melting of two-dimensional deformable particle systems. Physica A 623:128833. https:\/\/doi.org\/10.1016\/j.physa.2023.128833","journal-title":"Physica A"},{"issue":"18","key":"2286_CR18","doi-asserted-by":"publisher","first-page":"3325","DOI":"10.1039\/D3SM00166K","volume":"19","author":"Z Huang","year":"2023","unstructured":"Huang Z, Deng W, Zhang S, Li S (2023) Optimal shapes of disk assembly in saturated random packings. Soft Matter 19(18):3325\u20133336. https:\/\/doi.org\/10.1039\/D3SM00166K","journal-title":"Soft Matter"},{"key":"2286_CR19","doi-asserted-by":"crossref","unstructured":"Boromand A, Signoriello A, Ye F, O'Hern CS, Shattuck MD (2018) Jamming of deformable polygons. Phys Rev Lett 121(24) 248003. https:\/\/link.aps.org\/doi\/10.1103\/PhysRevLett.121.248003. Accessed 03 Dec 2023","DOI":"10.1103\/PhysRevLett.121.248003"},{"issue":"4","key":"2286_CR20","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1093\/comjnl\/21.4.324","volume":"21","author":"BA Lewis","year":"1978","unstructured":"Lewis BA, Robinson JS (1978) Triangulation of planar regions with applications. Comput J 21(4):324\u2013332. https:\/\/doi.org\/10.1093\/comjnl\/21.4.324","journal-title":"Comput J"},{"key":"2286_CR21","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1057\/palgrave.jors.2601011","volume":"51","author":"S Hartmann","year":"2000","unstructured":"Hartmann S (2000) Packing problems and project scheduling models: an integrating perspective. J Oper Res Soc 51:1083\u20131092","journal-title":"J Oper Res Soc"},{"key":"2286_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05005-8","volume-title":"Solving non-standard packing problems by global optimization and heuristics","author":"G Fasano","year":"2014","unstructured":"Fasano G (2014) Solving non-standard packing problems by global optimization and heuristics. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-05005-8"},{"key":"2286_CR23","doi-asserted-by":"publisher","first-page":"2126","DOI":"10.1007\/s11036-020-01556-w","volume":"25","author":"I Litvinchev","year":"2020","unstructured":"Litvinchev I, Romanova T, Corrales-Diaz R, Esquerra-Arguelles A, Martinez-Noa A (2020) Lagrangian approach to modeling placement conditions in optimized packing problems. Mob Netw Appl 25:2126\u20132133","journal-title":"Mob Netw Appl"},{"key":"2286_CR24","unstructured":"Sahinidis NV (2019) BARON 19.12.7: global optimization of mixed-integer nonlinear programs, User's manual"},{"issue":"2","key":"2286_CR25","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 NV (2005) A polyhedral branch-and-cut approach to global optimization. Math Program 103(2):225\u2013249","journal-title":"Math Program"},{"issue":"173","key":"2286_CR26","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1090\/S0025-5718-1986-0815838-7","volume":"46","author":"EL Allgower","year":"1986","unstructured":"Allgower EL, Schmidt PH (1986) Computing volumes of polyhedra. Math Comput 46(173):171\u2013174","journal-title":"Math Comput"},{"issue":"4","key":"2286_CR27","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1080\/07468342.1986.11972974","volume":"17","author":"B Braden","year":"1986","unstructured":"Braden B (1986) The surveyor\u2019s area formula. Coll Math J 17(4):326\u2013337","journal-title":"Coll Math J"},{"key":"2286_CR28","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/B978-0-12-336156-1.50023-9","volume-title":"Graphics gems IV","author":"FS Hill Jr","year":"1994","unstructured":"Hill FS Jr (1994). In: Heckbert PS (ed) Graphics gems IV. Academic Press, San Diego, pp 138\u2013148"},{"key":"2286_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5563-6","volume-title":"Nonlinear multiobjective optimization","author":"K Miettinen","year":"2012","unstructured":"Miettinen K (2012) Nonlinear multiobjective optimization. Springer, New York. https:\/\/doi.org\/10.1007\/978-1-4615-5563-6"},{"key":"2286_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83724-1_12","volume-title":"Algorithms and model formulations in mathematical programming. NATO ASI series","author":"R Fourer","year":"1989","unstructured":"Fourer R, Gay DM, Kernighan BW (1989) AMPL: a mathematical programing language. In: Wallace SW (ed) Algorithms and model formulations in mathematical programming. NATO ASI series, vol 51. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-83724-1_12"},{"issue":"3","key":"2286_CR31","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/99.714603","volume":"5","author":"J Czyzyk","year":"1998","unstructured":"Czyzyk J, Mesnier MP, Mor\u00e9 JJ (1998) The NEOS server. IEEE J Comput Sci Eng 5(3):68\u201375","journal-title":"IEEE J Comput Sci Eng"},{"key":"2286_CR32","unstructured":"Dolan E (2001) The NEOS Server 4.0 administrative guide. Technical memorandum ANL\/MCS-TM-250, mathematics and computer science division. Argonne National Laboratory. Available at https:\/\/www.mcs.anl.gov\/papers\/TM-250.pdf. Accessed 03 Dec 2023"},{"key":"2286_CR33","unstructured":"Gropp W, Mor\u00e9 JJ (1997).\u00a0Optimization environments and the NEOS server: Tributes to M.J.D. Powell. In: Buhmann MD, Iserles A (eds) Approximation theory and optimization. Cambridge University Press, pp 167\u2013182"},{"issue":"1","key":"2286_CR34","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ejor.2020.09.021","volume":"291","author":"T Romanova","year":"2021","unstructured":"Romanova T, Stoyan Y, Pankratov A, Litvinchev I, Plankovskyy S, Tsegelnyk Y, Shypul O (2021) Sparsest balanced packing of irregular 3D objects in a cylindrical container. Eur J Oper Res 291(1):84\u2013100. https:\/\/doi.org\/10.1016\/j.ejor.2020.09.021","journal-title":"Eur J Oper Res"},{"issue":"7","key":"2286_CR35","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1134\/S0965542507070032","volume":"47","author":"I Litvinchev","year":"2007","unstructured":"Litvinchev I (2007) Refinement of lagrangian bounds in optimization problems. Comput Math Math Phys 47(7):1101\u20131108. https:\/\/doi.org\/10.1134\/S0965542507070032","journal-title":"Comput Math Math Phys"},{"issue":"3","key":"2286_CR36","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10878-008-9196-3","volume":"19","author":"I Litvinchev","year":"2010","unstructured":"Litvinchev I, Rangel S, Saucedo J (2010) A Lagrangian bound for many-to-many assignment problems. J Comb Optim 19(3):241\u2013257. https:\/\/doi.org\/10.1007\/s10878-008-9196-3","journal-title":"J Comb Optim"},{"issue":"1","key":"2286_CR37","doi-asserted-by":"publisher","first-page":"60","DOI":"10.4018\/ijeoe.2012010104","volume":"1","author":"I Litvinchev","year":"2012","unstructured":"Litvinchev I, Ozuna L (2012) Lagrangian bounds and a heuristic for the two-stage capacitated facility location problem. Int J Energy Optim Eng 1(1):60\u201372. https:\/\/doi.org\/10.4018\/ijeoe.2012010104","journal-title":"Int J Energy Optim Eng"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-023-02286-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11036-023-02286-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-023-02286-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T11:25:44Z","timestamp":1728041144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11036-023-02286-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,9]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["2286"],"URL":"https:\/\/doi.org\/10.1007\/s11036-023-02286-5","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[2024,1,9]]},"assertion":[{"value":"21 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}