New results in the packing of equal circles in a square (Q1896364): Difference between revisions

The authors investigate the problem of maximizing the radius of \(n\) non- overlapping circles of even size in the unit square. They give an obvious transformation into a nonlinear optimization problem, and look for local optima by computer. The solutions obtained in this way match the known results for all \(n\leq 30\), improve the case \(n=15\), and yield new results for \(n= 28, 29\).