Optimal packing of 28 equal circles in a unit square -- the first reliable solution

DOI10.1023/B:NUMA.0000049472.75023.0AMaRDI QIDQ2387771zbMATH OpenFDO

Authors Mihály Csaba Markót

Publication date 5 September 2005

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:NUMA.0000049472.75023.0A

zbMATH Keywords

branch-and-bound methodscircle packinginterval arithmetic

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Circle packings and discrete conformal geometry (52C26) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 1748532
• More optimal packings of equal circles in a square
• Packing equal circles in a square: A deterministic global optimization approach
• Some new structures for the ``equal circles packing in a square problem
• scientific article; zbMATH DE number 432979
• New results in the packing of equal circles in a square
• scientific article; zbMATH DE number 1748533
• Some progress in the packing of equal circles in a square
• An interval method to validate optimal solutions of the ``packing circles in a unit square problems

Cited in

(15)

• On the packing of fourteen congruent spheres in a cube
• Packing equal circles in a square: A deterministic global optimization approach
• Optimal substructures in optimal and approximate circle packings
• New results in the packing of equal circles in a square
• Statistical inference for disordered sphere packings
• Iterated dynamic thresholding search for packing equal circles into a circular container
• Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus
• Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing
• A reliable area reduction technique for solving circle packing problems
• scientific article; zbMATH DE number 432979 (Why is no real title available?)
• scientific article; zbMATH DE number 1748533 (Why is no real title available?)
• Packing, covering and tiling in two-dimensional spaces
• A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
• Greedy vacancy search algorithm for packing equal circles in a square
• Interval methods for verifying structural optimality of circle packing configurations in the unit square

This page was built for publication: Optimal packing of 28 equal circles in a unit square -- the first reliable solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387771)