A reliable area reduction technique for solving circle packing problems
From MaRDI portal
Recommendations
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Improved interval methods for solving circle packing problems in the unit square
- An interval method to validate optimal solutions of the ``packing circles in a unit square problems
- scientific article; zbMATH DE number 1748533
- Interval methods for verifying structural optimality of circle packing configurations in the unit square
Cites work
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- scientific article; zbMATH DE number 432979 (Why is no real title available?)
- More optimal packings of equal circles in a square
- Optimal packing of 28 equal circles in a unit square -- the first reliable solution
- Packing equal circles in a square: A deterministic global optimization approach
Cited in
(5)- On tackling reverse convex constraints for non-overlapping of unequal circles
- Improved interval methods for solving circle packing problems in the unit square
- On limits of dense packing of equal spheres in a cube
- PERM for solving circle packing problem
- A literature review on circle and sphere packing problems: models and methodologies
This page was built for publication: A reliable area reduction technique for solving circle packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492666)