{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T04:32:05Z","timestamp":1762057925627,"version":"build-2065373602"},"reference-count":50,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T00:00:00Z","timestamp":1656892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>The packing of different circles in a circular container under balancing and distance conditions is considered. Two problems are studied: the first minimizes the container\u2019s radius, while the second maximizes the minimal distance between circles, as well as between circles and the boundary of the container. Mathematical models and solution strategies are provided and illustrated with computational results.<\/jats:p>","DOI":"10.3390\/computation10070113","type":"journal-article","created":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T11:15:05Z","timestamp":1656933305000},"page":"113","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Balanced Circular Packing Problems with Distance Constraints"],"prefix":"10.3390","volume":"10","author":[{"given":"Tetyana","family":"Romanova","sequence":"first","affiliation":[{"name":"Department of Mathematical Modeling and Optimal Design, A. Pidhornyi Institute for Mechanical Engineering Problems, National Academy of Sciences of Ukraine, 61046 Kharkiv, Ukraine"},{"name":"Department of Systems Engineering, Kharkiv National University of Radioelectronics, 14 Nauky Ave., 61166 Kharkiv, Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olexandr","family":"Pankratov","sequence":"additional","affiliation":[{"name":"Department of Mathematical Modeling and Optimal Design, A. Pidhornyi Institute for Mechanical Engineering Problems, National Academy of Sciences of Ukraine, 61046 Kharkiv, Ukraine"},{"name":"Department of Systems Engineering, Kharkiv National University of Radioelectronics, 14 Nauky Ave., 61166 Kharkiv, Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1850-4755","authenticated-orcid":false,"given":"Igor","family":"Litvinchev","sequence":"additional","affiliation":[{"name":"Faculty of Mechanical and Electrical Engineering, Nuevo Leon State University (UANL), Av. Universidad s\/n, Col. Ciudad Universitaria, San Nicolas de los Garza 66455, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4036-2543","authenticated-orcid":false,"given":"Petro","family":"Stetsyuk","sequence":"additional","affiliation":[{"name":"Department of Nonsmooth Optimization Methods, V. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, 40 Academika Glushkova Ave., 03187 Kyiv, Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleksii","family":"Lykhovyd","sequence":"additional","affiliation":[{"name":"Department of Nonsmooth Optimization Methods, V. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, 40 Academika Glushkova Ave., 03187 Kyiv, Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8539-9828","authenticated-orcid":false,"given":"Jose Antonio","family":"Marmolejo-Saucedo","sequence":"additional","affiliation":[{"name":"Facultad de Ingenieria, Universidad Panamericana, Augusto Rodin 498, Ciudad de Mexico 03920, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0755-1046","authenticated-orcid":false,"given":"Pandian","family":"Vasant","sequence":"additional","affiliation":[{"name":"Modeling Evolutionary Algorithms Simulation & Artificial Intelligence (MERLIN), Faculty of Electrical & Electronic Engineering, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,7,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Bowers, P.L., and Stephenson, K. (2004). Uniformizing Dessins and BelyiMaps via Circle Packing, American Mathematical Soc.","DOI":"10.1090\/memo\/0805"},{"key":"ref_2","unstructured":"Stephenson, K. (2005). Introduction to Circle Packing: The Theory of Discrete Analytic Functions, Cambridge University Press."},{"key":"ref_3","unstructured":"Bowers, P.L. (2022, March 27). Introduction to Circle Packing: A Review. Available online: https:\/\/www.math.fsu.edu\/~aluffi\/archive\/paper356.pdf."},{"key":"ref_4","first-page":"1","article-title":"A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies","volume":"2009","author":"Hifi","year":"2009","journal-title":"Adv. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1016\/j.ejor.2007.01.054","article-title":"Solving circle packing problems by global optimization: Numerical results and industrial applications","volume":"191","author":"Castillo","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"ref_6","unstructured":"Yagiura, M., Umetani, S., Imahori, S., and Hu, Y. (2022). Cutting and Packing Problems: From the Perspective of Combinatorial Optimization, Springer."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.ejor.2015.09.001","article-title":"Iterated tabu search and variable neighborhood descent for packing un-equal circles into a circular container","volume":"250","author":"Zeng","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.cor.2017.12.002","article-title":"An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container","volume":"92","author":"He","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"ref_9","unstructured":"Astarkov, S. (2019, January 22\u201328). On regular covering\/packing of the Euclidean plane with circles. Proceedings of the International Conference on Geometric Analysis in Honor of the 90th Anniversary of Academician Yu. G. Reshetnyak, Novosibirsk, Russia."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1057\/palgrave.jors.2601836","article-title":"Greedy algorithms for packing unequal circles into a rectangular container","volume":"56","author":"Huang","year":"2005","journal-title":"J. Oper. Res. Soc."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2357","DOI":"10.1016\/j.cor.2006.11.002","article-title":"Minimizing the object dimensions in circle and sphere packing problems","volume":"35","author":"Birgin","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1016\/j.cor.2009.09.017","article-title":"New and improved results for packing identical unitary radius circles within triangles, rectangles and strips","volume":"37","author":"Birgin","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1111\/j.1475-3995.2008.00655.x","article-title":"Algorithms for the circular two-dimensional open dimension problem","volume":"15","author":"Akeb","year":"2008","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.cie.2011.02.009","article-title":"An augmented beam search-based algorithm for the circular open dimension problem","volume":"61","author":"Akeb","year":"2011","journal-title":"Comput. Ind. Eng."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1080\/00207160.2012.685468","article-title":"Packing equal circles into a circle with circular prohibited areas","volume":"89","author":"Stoyan","year":"2012","journal-title":"Int. J. Comput. Math."},{"key":"ref_16","unstructured":"Zhuang, X., Yan, L., and Chen, L. (2015, January 12\u201317). Packing equal circles in a damaged square. Proceedings of the International Joint Conference on Neural Networks (IJCNN), Killarney, Ireland."},{"key":"ref_17","first-page":"177","article-title":"An algorithm of packing congruent circles in a multiply connect-ed set with non-euclidean metrics","volume":"17","author":"Kazakov","year":"2016","journal-title":"Numer. Methods Program."},{"key":"ref_18","first-page":"1449","article-title":"Packing a fixed number of identical circles in a circular container with circular prohibited areas","volume":"13","author":"Beasley","year":"2018","journal-title":"Optim. Lett."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1016\/j.cie.2013.08.010","article-title":"A coarse-to-fine quasi-physical optimization method for solving the circle pack-ing problem with equilibrium constraints","volume":"66","author":"He","year":"2013","journal-title":"Comput. Ind. Eng."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1007\/s10559-015-9746-5","article-title":"Balance packing problem for 3D-objects: Mathematical model and solution methods","volume":"51","author":"Kovalenko","year":"2015","journal-title":"Cybern. Syst. Anal."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s11590-015-0937-9","article-title":"On the global minimum in a balanced circular packing problem","volume":"10","author":"Stetsyuk","year":"2016","journal-title":"Optim. Lett."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Fasano, G., and Pinter, J.D. (2019). Modeling and Optimization in Space Engineering: State of the Art and New Challenges, Springer.","DOI":"10.1007\/978-3-030-10501-3"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.physa.2019.02.007","article-title":"A stimulus\u2013response-based allocation method for the circle packing problem with equilibrium constraints","volume":"522","author":"Wang","year":"2019","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1134\/S1064230715020070","article-title":"Packing circular-like objects in a rectangular container","volume":"54","author":"Litvinchev","year":"2015","journal-title":"J. Comput. Syst. Sci. Int."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Kazakov, A.L., Lempert, A.A., and Nguyen, H.L. (2017). The Problem of the Optimal Packing of the Equal Circles for Special Non-Euclidean Metric. International Conference on Analysis of Images, Social Networks and Texts, Springer.","DOI":"10.1007\/978-3-319-52920-2_6"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1016\/S1665-6423(14)70088-4","article-title":"Approximate Packing Circles in a Rectangular Container: Valid Inequalities and Nesting","volume":"12","author":"Litvinchev","year":"2014","journal-title":"J. Appl. Res. Technol."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1111\/itor.12107","article-title":"Recursive circle packing problems","volume":"23","author":"Pedroso","year":"2016","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10479-018-3115-5","article-title":"Price-and-verify: A new algorithm for recursive circle packing using Dantzig\u2013Wolfe decomposition","volume":"284","author":"Gleixner","year":"2018","journal-title":"Ann. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.21136\/AM.2020.0244-19","article-title":"Optimal packings for filled rings of circles","volume":"65","author":"Ekanayake","year":"2020","journal-title":"Appl. Math."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1016\/j.procs.2022.01.275","article-title":"Packing and stacking rings into rectangular bins","volume":"200","author":"Scholz","year":"2022","journal-title":"Procedia Comput. Sci."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s40863-022-00301-3","article-title":"Techniques and results on approximation algorithms for packing circles","volume":"16","author":"Miyazawa","year":"2022","journal-title":"S\u00e3o Paulo J. Math. Sci."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.ejor.2013.04.050","article-title":"Linear models for the approximate solution of the problem of packing equal circles into a given domain","volume":"230","author":"Galiev","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"4743","DOI":"10.1007\/s11276-018-1869-y","article-title":"Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container","volume":"26","author":"Litvinchev","year":"2020","journal-title":"Wirel. Netw."},{"key":"ref_34","first-page":"125076","article-title":"VOROPACK-D: Real-time disk packing algorithm using Voronoi diagram","volume":"375","author":"Ryu","year":"2020","journal-title":"Appl. Math. Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"105140","DOI":"10.1016\/j.cor.2020.105140","article-title":"Adaptive large neighborhood search for solving the circle bin packing problem","volume":"127","author":"He","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"105826","DOI":"10.1016\/j.cor.2022.105826","article-title":"Adaptive simulated annealing with greedy search for the circle bin packing problem","volume":"144","author":"Yuan","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"ref_37","unstructured":"E. Specht (2022, April 04). Available online: http:\/\/packomania.com."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"3900","DOI":"10.1080\/00207543.2020.1755471","article-title":"Sparsest packing of two-dimensional objects","volume":"59","author":"Romanova","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1080\/00207543.2019.1697836","article-title":"Optimal layout of ellipses and its application for additive manufacturing","volume":"59","author":"Romanova","year":"2019","journal-title":"Int. J. Prod. Res."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Shor, N.Z. (1998). Nondifferentiable Optimization and Polynomial Problems, Kluwer Academic.","DOI":"10.1007\/978-1-4757-6015-6"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Butenko, S., Pardalos, P.M., and Shylo, V. (2017). Shor\u2019s r-Algorithms: Theory and practice. Optimization Methods and Applications: In Honor of Ivan V. Sergienko\u2019s 80th Birthday, Springer.","DOI":"10.1007\/978-3-319-68640-0"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1007\/s10559-017-9971-1","article-title":"Theory and Software Implementations of Shor\u2019s r-Algorithms*","volume":"53","author":"Stetsyuk","year":"2017","journal-title":"Cybern. Syst. Anal."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1023\/B:CASA.0000003503.25710.84","article-title":"Algorithms of Nondifferentiable Optimization: Development and Application","volume":"39","author":"Shor","year":"2003","journal-title":"Cybern. Syst. Anal."},{"key":"ref_44","unstructured":"(2022, March 14). Octave [Free Access Electronic Resource]. Available online: http:\/\/www.octave.org."},{"key":"ref_45","unstructured":"(2022, April 04). Cluster SKIT. Available online: https:\/\/icybcluster.org.ua\/."},{"key":"ref_46","first-page":"25","article-title":"On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming","volume":"106","author":"Biegler","year":"2005","journal-title":"Math. Program."},{"key":"ref_47","first-page":"214","article-title":"Decomposition Algorithm for Irregular Placement Problems","volume":"Volume 1072","author":"Vasant","year":"2020","journal-title":"Advances in Intelligent Systems and Computing; Intelligent Computing and Optimization ICO 2019"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1016\/S0305-0548(99)00027-1","article-title":"Localization of the optimal solution and a posteriori bounds for aggregation","volume":"26","author":"Litvinchev","year":"1999","journal-title":"Comput. Oper. Res."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/02331939108843642","article-title":"Decomposition-aggregation method for convex programming problems","volume":"22","author":"Litvinchev","year":"1991","journal-title":"Optimization"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1007\/s10559-019-00199-4","article-title":"Parallel Computing Technologies for Solving Optimization Problems of Geometric Design","volume":"55","author":"Romanova","year":"2019","journal-title":"Cybern. Syst. Anal."}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/10\/7\/113\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:42:42Z","timestamp":1760139762000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/10\/7\/113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,4]]},"references-count":50,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["computation10070113"],"URL":"https:\/\/doi.org\/10.3390\/computation10070113","relation":{},"ISSN":["2079-3197"],"issn-type":[{"type":"electronic","value":"2079-3197"}],"subject":[],"published":{"date-parts":[[2022,7,4]]}}}