{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:38:47Z","timestamp":1759847927966,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:00:00Z","timestamp":1590451200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:00:00Z","timestamp":1590451200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s11036-020-01556-w","type":"journal-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T04:02:20Z","timestamp":1590465740000},"page":"2126-2133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Lagrangian Approach to Modeling Placement Conditions in Optimized Packing Problems"],"prefix":"10.1007","volume":"25","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-8618-4917","authenticated-orcid":false,"given":"Tatiana","family":"Romanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rogelio","family":"Corrales-Diaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aned","family":"Esquerra-Arguelles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Martinez-Noa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"issue":"3","key":"1556_CR1","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.ejor.2019.04.045","volume":"282","author":"AAS Leao","year":"2020","unstructured":"Leao AAS, Toledo FMB, Oliveira JF, Carravilla MA, Alvarez-Valdez R (2020) Irregular packing problems: a review of mathematical models. Eur J Oper Res 282(3):803\u2013822","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1556_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.ejor.2020.01.051","volume":"485","author":"T Romanova","year":"2020","unstructured":"Romanova T, Litvinchev I, Pankratov A (2020) Packing ellipsoids in an optimized cylinder. Eur J Oper Res 485(2):429\u2013443","journal-title":"Eur J Oper Res"},{"key":"1556_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1978802.1978811","volume":"43","author":"B Wang","year":"2011","unstructured":"Wang B (2011) Coverage problems in sensor networks: a survey. ACM Comput Surv 43:1\u201356","journal-title":"ACM Comput Surv"},{"issue":"8","key":"1556_CR4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.3991\/ijoe.v12i08.6068","volume":"12","author":"L Zhu","year":"2016","unstructured":"Zhu L, Fan C, Wu H, Wen Z (2016) Coverage optimization algorithm of wireless sensor network based on mobile nod. Int J Online Biomed Eng 12(8):45\u201350","journal-title":"Int J Online Biomed Eng"},{"key":"1556_CR5","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10898-007-9274-6","volume":"43","author":"J Kallrath","year":"2009","unstructured":"Kallrath J (2009) Cutting circles and polygons from area-minimizing rectangles. J Glob Optim 43:299\u2013328","journal-title":"J Glob Optim"},{"key":"1556_CR6","unstructured":"Kampas FJ, Pint\u00e9r JD, Castillo I (2016) General ellipse packings in an optimized circle using embedded Lagrange multipliers. http:\/\/www.optimization-online.org\/DB_HTML\/2016\/01\/5293.html"},{"issue":"7","key":"1556_CR7","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1007\/s11590-019-01423-y","volume":"13","author":"F Kampas","year":"2019","unstructured":"Kampas F, Castillo I, Pint\u00e9r J (2019) Optimized ellipse packings in regular polygons. Optim Lett 13(7):1583\u20131613","journal-title":"Optim Lett"},{"issue":"1","key":"1556_CR8","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, Pankratov A (2018) Packing of concave polyhedra with continuous rotations using nonlinear optimization. Eur J Oper Res 268(1):37\u201353","journal-title":"Eur J Oper Res"},{"key":"1556_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1134\/S1064230715020070","volume":"54","author":"I Litvinchev","year":"2015","unstructured":"Litvinchev I, Infante L, Ozuna L (2015) Packing circular-like objects in a rectangular container. J Computer Syst Sci Int 54:259\u2013267","journal-title":"J Computer Syst Sci Int"},{"key":"1556_CR10","doi-asserted-by":"crossref","unstructured":"Litvinchev I, Infante L, Ozuna L (2014) Approximate circle packing in a rectangular container: integer programming formulations and valid inequalities, in: 5th international conference on computational logistics, Springer, pp. 47-60","DOI":"10.1007\/978-3-319-11421-7_4"},{"key":"1556_CR11","doi-asserted-by":"publisher","unstructured":"Torres R, Marmolejo JA, Litvinchev I (2018) Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container. Wireless Netw. https:\/\/doi.org\/10.1007\/s11276-018-1869-y","DOI":"10.1007\/s11276-018-1869-y"},{"key":"1556_CR12","doi-asserted-by":"publisher","unstructured":"Pankratov A, Romanova T, Litvinchev I, Marmolejo JA (2020) An optimized covering spheroids by spheres. Appl Sci 10(5):1846. https:\/\/doi.org\/10.3390\/app10051846","DOI":"10.3390\/app10051846"},{"issue":"5","key":"1556_CR13","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, Yu S, Romanova T (2010) Mathematical model and efficient algorithms for object packing problem. Comput Geom 43(5):535\u2013553","journal-title":"Comput Geom"},{"issue":"4","key":"1556_CR14","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/s10559-015-9746-5","volume":"51","author":"AA Kovalenko","year":"2015","unstructured":"Kovalenko AA, Romanova TE, Stetsyuk PI (2015) Balance layout problem for 3D-objects: mathematical model and solution methods. Cybern Syst Anal 51(4):556\u2013565","journal-title":"Cybern Syst Anal"},{"key":"1556_CR15","unstructured":"Litvinchev I (2020) Modeling containment and non-overlaping in optimized packing. Technical report, PISIS-2020-1 Graduate program in systems engineering, UANL, Mexico"},{"key":"1556_CR16","doi-asserted-by":"crossref","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511804441"},{"issue":"2","key":"1556_CR17","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1006\/jmaa.1999.6484","volume":"236","author":"MA Hanson","year":"1999","unstructured":"Hanson MA (1999) Invexity and the Kuhn-Tucker theorem. J Math Anal Appl 236(2):594\u2013604","journal-title":"J Math Anal Appl"},{"key":"1556_CR18","doi-asserted-by":"crossref","unstructured":"Murty KG (2010) Optimization for decision making: linear and quadratic models. Springer","DOI":"10.1007\/978-1-4419-1291-6"},{"key":"1556_CR19","volume-title":"Regular Polytopes 3rd edition","author":"HSM Coxeter","year":"1973","unstructured":"Coxeter HSM (1973) Regular Polytopes 3rd edition. Dover, NY"},{"key":"1556_CR20","unstructured":"Sahinidis NV (2019) BARON 19.12.7: global optimization of mixed-integer nonlinear programs, User's manual"},{"issue":"2","key":"1556_CR21","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 Progr 103(2):225\u2013249","journal-title":"Math Progr"},{"key":"1556_CR22","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 MM (2019) Packing circles into perimeter-minimizing convex hulls. J Glob Optim 73:723\u2013759","journal-title":"J Glob Optim"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-020-01556-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11036-020-01556-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-020-01556-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T10:17:40Z","timestamp":1722939460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11036-020-01556-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,26]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1556"],"URL":"https:\/\/doi.org\/10.1007\/s11036-020-01556-w","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[2020,5,26]]},"assertion":[{"value":"26 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors would like to declare that there are no conflicts of interests with any third party.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}]}}