A reliable area reduction technique for solving circle packing problems
From MaRDI portal
Publication:2492666
DOI10.1007/s00607-005-0155-xzbMath1091.52503OpenAlexW2115874935MaRDI QIDQ2492666
Mihály Csaba Markót, Tibor Csendes
Publication date: 14 June 2006
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-005-0155-x
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Interval and finite arithmetic (65G30) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Circle packings and discrete conformal geometry (52C26)
Related Items
A literature review on circle and sphere packing problems: models and methodologies ⋮ On limits of dense packing of equal spheres in a cube ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ Improved interval methods for solving circle packing problems in the unit square
Uses Software
Cites Work
- Unnamed Item
- Packing equal circles in a square: A deterministic global optimization approach
- More optimal packings of equal circles in a square
- 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
