Iterated dynamic thresholding search for packing equal circles into a circular container
From MaRDI portal
Publication:2077968
DOI10.1016/j.ejor.2021.08.044zbMath1495.90157OpenAlexW3197876480MaRDI QIDQ2077968
Zhang-Hua Fu, Xiangjing Lai, Zhipeng Lü, Jin-Kao Hao, Dong Yue
Publication date: 23 February 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.08.044
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Related Items
The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices ⋮ Iterated dynamic neighborhood search for packing equal circles on a sphere
Uses Software
Cites Work
- On the global minimum in a balanced circular packing problem
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- Packing unequal spheres into various containers
- High density packings of equal circles in rectangles with variable aspect ratio
- Packing unequal circles using formulation space search
- Global optimization method for finding dense packings of equal circles in a circle
- Greedy vacancy search algorithm for packing equal circles in a square
- A heuristic for the circle packing problem with a variety of containers
- Combinatorial configurations in balance layout optimization problems
- Efficient algorithm for placing a given number of base stations to cover a convex region
- On the limited memory BFGS method for large scale optimization
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Efficiently packing unequal disks in a circle
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Solving the problem of packing equal and unequal circles in a circular container
- The densest packing of 19 congruent circles in a circle
- Densest packings of eleven congruent circles in a circle
- Dense packings of congruent circles in a circle
- Improving dense packings of equal disks in a square
- Packing equal circles in a square: A deterministic global optimization approach
- A local search-based method for sphere packing problems
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- Reformulation descent applied to circle packing problems
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Optimized packing multidimensional hyperspheres: a unified approach
- Iterated tabu search for the circular open dimension problem
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- Packing unequal circles into a strip of minimal length with a jump algorithm
- PERM for solving circle packing problem
- Minimizing the object dimensions in circle and sphere packing problems
- A dynamic adaptive local search algorithm for the circular packing problem
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Global Optimization of Morse Clusters by Potential Energy Transformations
- Disk Packing in a Square: A New Global Optimization Approach
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten
- Packing Cylinders into Cylindrical Containers
- Discrete and Computational Geometry
- Global optimization on funneling landscapes
- Fast global optimization of difficult Lennard-Jones clusters
