Greedy vacancy search algorithm for packing equal circles in a square
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1748533
- Global optimization method for finding dense packings of equal circles in a circle
- scientific article; zbMATH DE number 1748532
- scientific article; zbMATH DE number 5629935
- Optimal packing of 28 equal circles in a unit square -- the first reliable solution
Cites work
- scientific article; zbMATH DE number 6183022 (Why is no real title available?)
- scientific article; zbMATH DE number 432979 (Why is no real title available?)
- scientific article; zbMATH DE number 1748533 (Why is no real title available?)
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
- Disk packing in a square: a new global optimization approach
- Efficiently packing unequal disks in a circle
- Improving dense packings of equal disks in a square
- Interval methods for verifying structural optimality of circle packing configurations in the unit square
- More optimal packings of equal circles in a square
- New approaches to circle packing in a square. With program codes.
- New results in the packing of equal circles in a square
- On the limited memory BFGS method for large scale optimization
- Packing equal circles in a square: A deterministic global optimization approach
- Packing up to 50 equal circles in a square
- Unsolved problems in geometry
Cited in
(9)- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Clustering methods for large scale geometrical global optimization
- A memetic algorithm to pack unequal circles into a square
- Iterated dynamic thresholding search for packing equal circles into a circular container
- A heuristic algorithm for a packing problem of equal spheres in a sphere
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Greedy algorithms for packing unequal circles into a rectangular container
- An action-space-based global optimization algorithm for packing circles into a square container
- Efficient approximations for the online dispersion problem
This page was built for publication: Greedy vacancy search algorithm for packing equal circles in a square
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613329)