Disk packing in a square: a new global optimization approach
DOI10.1287/IJOC.1080.0263zbMATH Open1243.90084OpenAlexW2095937663MaRDI QIDQ2901032FDOQ2901032
Authors: Bernardetta Addis, Fabio Schoen, Marco Locatelli 
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/48ccf0b734681255381fb30487aefae15d1ba109
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
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Combinatorial aspects of packing and covering (05B40) Discrete location and assignment (90B80)
Cited In (26)
- Iterated dynamic neighborhood search for packing equal circles on a sphere
- Clustering methods for large scale geometrical global optimization
- Global optimization approaches for optimal trajectory planning
- A global optimization method for the design of space trajectories
- Feasibility in reverse convex mixed-integer programming
- Assessing Basin Identification Methods for Locating Multiple Optima
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm
- Global optimization method for finding dense packings of equal circles in a circle
- 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
- Greedy vacancy search algorithm for packing equal circles in a square
- Differential evolution methods based on local searches
- Uniformity of point samples in metric spaces using gap ratio
- Packing disks into disks with optimal worst-case density
- Efficiently packing unequal disks in a circle
- Computational investigation of simple memetic approaches for continuous global optimization
- Solving the problem of packing equal and unequal circles in a circular container
- A new quasi-human algorithm for solving the packing problem of unit equilateral triangles
- Spreading points using gradient and tabu
- A short note on a simple search heuristic for the diskspacking problem
- Improving dense packings of equal disks in a square
- Local search based heuristics for global optimization: atomic clusters and beyond
- A heuristic approach for packing identical rectangles in convex regions
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- Damped Arrow-Hurwicz algorithm for sphere packing
Uses Software
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)
