Interval methods for verifying structural optimality of circle packing configurations in the unit square
DOI10.1016/J.CAM.2005.08.039zbMATH Open1107.52013OpenAlexW2135620139MaRDI QIDQ861900FDOQ861900
Publication date: 2 February 2007
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2005.08.039
Recommendations
- Optimal packing of 28 equal circles in a unit square -- the first reliable solution
- 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
- Global optimization method for finding dense packings of equal circles in a circle
Nonlinear programming (90C30) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Interval and finite arithmetic (65G30) Circle packings and discrete conformal geometry (52C26)
Cites Work
- Interval Methods for Systems of Equations
- Title not available (Why is that?)
- Introduction to global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Densest packings of equal circles in a square
- Packing up to 50 equal circles in a square
- More optimal packings of equal circles in a square
- Repeated patterns of dense packings of equal disks in a square
- Optimal packing of 28 equal circles in a unit square -- the first reliable solution
- Title not available (Why is that?)
- Some new structures for the ``equal circles packing in a square problem
Cited In (13)
- Minimal surface convex hulls of spheres
- Global optimization method for finding dense packings of equal circles in a circle
- Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus
- A literature review on circle and sphere packing problems: models and methodologies
- On tackling reverse convex constraints for non-overlapping of unequal circles
- Greedy vacancy search algorithm for packing equal circles in a square
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Symplectic embedding problems, old and new
- Cutting ellipses from area-minimizing rectangles
- Techniques and results on approximation algorithms for packing circles
- A reliable area reduction technique for solving circle packing problems
- Rigorous packing of unit squares into a circle
- On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
Uses Software
This page was built for publication: Interval methods for verifying structural optimality of circle packing configurations in the unit square
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861900)
