Disk packing in a square: a new global optimization approach
From MaRDI portal
Publication:2901032
Recommendations
- Improving dense packings of equal disks in a square
- New approaches to circle packing in a square. With program codes.
- scientific article; zbMATH DE number 1748533
- Global optimization method for finding dense packings of equal circles in a circle
- Packing equal circles in a square: A deterministic global optimization approach
Cited in
(26)- Efficiently packing unequal disks in a circle
- Computational investigation of simple memetic approaches for continuous global optimization
- Assessing Basin Identification Methods for Locating Multiple Optima
- Global optimization approaches for optimal trajectory planning
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm
- Solving the problem of packing equal and unequal circles in a circular container
- Damped Arrow-Hurwicz algorithm for sphere packing
- Global optimization method for finding dense packings of equal circles in a circle
- Iterated dynamic neighborhood search for packing equal circles on a sphere
- A heuristic approach for packing identical rectangles in convex regions
- Local search based heuristics for global optimization: atomic clusters and beyond
- Uniformity of point samples in metric spaces using gap ratio
- Iterated dynamic thresholding search for packing equal circles into a circular container
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- A literature review on circle and sphere packing problems: models and methodologies
- Packing disks into disks with optimal worst-case density
- Clustering methods for large scale geometrical global optimization
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- Greedy vacancy search algorithm for packing equal circles in a square
- Differential evolution methods based on local searches
- Improving dense packings of equal disks in a square
- Spreading points using gradient and tabu
- A new quasi-human algorithm for solving the packing problem of unit equilateral triangles
- Feasibility in reverse convex mixed-integer programming
- A global optimization method for the design of space trajectories
- A short note on a simple search heuristic for the diskspacking problem
This page was built for publication: Disk packing in a square: a new global optimization approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901032)
