Pages that link to "Item:Q2387771"
From MaRDI portal
The following pages link to Optimal packing of 28 equal circles in a unit square -- the first reliable solution (Q2387771):
Displaying 14 items.
- Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
- Greedy vacancy search algorithm for packing equal circles in a square (Q613329) (← links)
- Interval methods for verifying structural optimality of circle packing configurations in the unit square (Q861900) (← links)
- On the packing of fourteen congruent spheres in a cube (Q1027757) (← links)
- An interval method to validate optimal solutions of the ``packing circles in a unit square'' problems (Q1574137) (← links)
- Packing equal circles in a square: A deterministic global optimization approach (Q1613419) (← links)
- Optimal substructures in optimal and approximate circle packings (Q1770344) (← links)
- New results in the packing of equal circles in a square (Q1896364) (← links)
- Statistical inference for disordered sphere packings (Q1951652) (← links)
- Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
- Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus (Q2193420) (← links)
- Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing (Q2397437) (← links)
- A reliable area reduction technique for solving circle packing problems (Q2492666) (← links)
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems (Q5317555) (← links)
