Abstract
The paper deals with the problem class of finding the densest packings of non-overlapping equal circles within a unit square. We introduce a new interval branch-and-bound algorithm designed specifically for this optimization problem. After a brief description of the applied algorithmic tools, the capabilities of the algorithm are shown by solving the previously unsolved problem of packing 28 circles. The result confirms the optimality of an earlier found approximate solution and shows that it is unique in a certain sense.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. de Groot M. Monagan, R. Peikert and D. Würtz, Packing circles in a square: Review and new results, in: System Modeling and Optimization–Proc. of the 15th IFIP Conf., ed. P. Kall, Zürich, 1991, Lecture Notes in Control and Information Services, Vol. 180 (Springer, 1992) pp. 45–54.
C. de Groot, R. Peikert and D. Würtz, The optimal packing of ten equal circles in a square, IPS Research Report 90–12, ETH, Zürich (1990).
R.L. Graham and B.D. Lubachevsky, Repeated patterns of dense packings of equal disks in a square, Electron. J. Combinatorics 3(R16) (1996).
R. Hammer, M. Hocks, U. Kulisch and D. Ratz, Numerical Toolbox for Verified Computing I. (Springer, Berlin, 1993).
http://www.packomania.com, updated by E. Specht.
O. Knüppel, PROFIL — Programmer's runtime optimized fast interval library, Bericht 93.4, Technische Universität Hamburg, Hamburg (1993).
O. Knüppel, A multiple precision arithmetic for PROFIL, Bericht 93.6, Technische Universität Hamburg, Hamburg (1993).
M. Locatelli and U. Raber, Packing equal circles in a square: A deterministic global optimization approach, Discrete Appl. Math. 122 (2002) 139–166.
M.Cs. Markót, An interval method to validate optimal solutions of the “Packing circles in a unit square” problems, CEJOR 8 (2000) 63–78.
M.Cs. Markót, T. Csendes and A.E. Csallner, Multisection in interval branch-and-bound methods for global optimization II. Numerical tests, J. Global Optim. 16 (2000) 219–228.
M.Cs. Markót and T. Csendes, A new verified optimization technique for the “Packing circles in a unit square” problems, submitted for publication; available from http://www.inf.u-szeged. hu/~markot/packcirc.htm.
R.E. Moore, Interval Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1966).
A. Neumaier, Introduction to Numerical Analysis (Cambridge Univ. Press, Cambridge, 2001).
K.J. Nurmela and P.R.J. Östergård, More optimal packings of equal circles in a square, Discrete Comput. Geometry 22 (1999) 439–457.
R. Peikert, Dichteste Packungen von gleichen Kreisen in einem Quadrat, Elemente der Mathematik 49 (1994) 17–25.
H. Ratschek and J. Rokne, New Computer Methods for Global Optimization (Ellis Horwood, Chichester, 1988).
P.G. Szabó, Some new structures for the “Equal circles packing in a square” problem, CEJOR 8 (2000) 79–91.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Markót, M.C. Optimal Packing of 28 Equal Circles in a Unit Square – The First Reliable Solution. Numerical Algorithms 37, 253–261 (2004). https://doi.org/10.1023/B:NUMA.0000049472.75023.0a
Issue Date:
DOI: https://doi.org/10.1023/B:NUMA.0000049472.75023.0a