Greedy vacancy search algorithm for packing equal circles in a square
From MaRDI portal
Publication:613329
DOI10.1016/j.orl.2010.07.004zbMath1202.90226OpenAlexW2018449309MaRDI QIDQ613329
Publication date: 20 December 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.07.004
Related Items (6)
Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container ⋮ An action-space-based global optimization algorithm for packing circles into a square container ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Clustering methods for large scale geometrical global optimization ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container ⋮ Packing a fixed number of identical circles in a circular container with circular prohibited areas
Uses Software
Cites Work
- New approaches to circle packing in a square. With program codes.
- Interval methods for verifying structural optimality of circle packing configurations in the unit square
- On the limited memory BFGS method for large scale optimization
- Efficiently packing unequal disks in a circle
- Unsolved problems in geometry
- Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
- Packing up to 50 equal circles in a square
- Improving dense packings of equal disks in a square
- Packing equal circles in a square: A deterministic global optimization approach
- More optimal packings of equal circles in a square
- New results in the packing of equal circles in a square
- Disk Packing in a Square: A New Global Optimization Approach
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Greedy vacancy search algorithm for packing equal circles in a square
