An interval method to validate optimal solutions of the ``packing circles in a unit square'' problems (Q1574137)

The problem of maximizing the size of \(n\) nonoverlapping equal disks in a unit square (this problem is equivalent to maximizing the minimum pairwise distance between \(n\) points in a unit square) is considered, and the use of interval methods as a part of an algorithm for finding optimal packings is discussed. A method for proving optimality of packings has been proposed by \textit{R. Peikert, D. Würtz, M. Monagan} and \textit{C. de Groot} [Lect. Notes Control Inf. Sci. 180, 45-54 (1992; Zbl 0789.52002)] and further developed by \textit{K. J. Nurmela} and \textit{P. R. J.Östergård} [Discrete Comput. Geom. 22, No. 3, 439-457 (1999; Zbl 0931.05019)]. In the current paper, (somewhat modified) parts of these earlier algorithms are put into the interval-method framework.