Iterated dynamic neighborhood search for packing equal circles on a sphere
From MaRDI portal
Publication:6164321
DOI10.1016/j.cor.2022.106121MaRDI QIDQ6164321
Xiangjing Lai, Jin-Kao Hao, Zhipeng Lü, Fred Glover, Dong Yue
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- High density packings of equal circles in rectangles with variable aspect ratio
- The strong thirteen spheres problem
- Global optimization method for finding dense packings of equal circles in a circle
- A heuristic for the circle packing problem with a variety of containers
- New approaches to circle packing in a square. With program codes.
- On the limited memory BFGS method for large scale optimization
- 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
- Finite point-sets on S 2 with minimum distance as large as possible
- Arrangement of 24 points on a sphere
- Distributing many points on a sphere
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- A memetic algorithm to pack unequal circles into a square
- Reformulation descent applied to circle packing problems
- Single-sized spheres on surfaces (S4)
- Iterated dynamic thresholding search for packing equal circles into a circular container
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- Minimizing the object dimensions in circle and sphere packing problems
- Über eine Abschätzung des kürzesten Abstandes zweier Punkte eines auf einer Kugelfläche liegenden Punktsystems
- Disk Packing in a Square: A New Global Optimization Approach
- Packing of regular tetrahedral quartets of circles on a sphere
- Point vortex equilibria and optimal packings of circles on a sphere
- The Tammes Problem for N = 14
- Multi-symmetric close packings of equal spheres on the spherical surface
- The densest packing of equal circles on a sphere
- Improved packing of equal circles on a sphere and rigidity of its graph
- The closest packing of equal circles on a sphere
- Packing regular triplets of circles on a sphere
- Global optimization on funneling landscapes
- A point balance algorithm for the spherical code problem