Spreading points using gradient and tabu
From MaRDI portal
Publication:6097431
DOI10.1007/s43069-023-00214-7zbMath1519.90205OpenAlexW4361273976MaRDI QIDQ6097431
Publication date: 5 June 2023
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s43069-023-00214-7
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing unit spheres into the smallest sphere using VNS and NLP
- A literature review on circle and sphere packing problems: models and methodologies
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Unsolved problems in geometry
- Packing up to 50 equal circles in a square
- Improving dense packings of equal disks in a square
- Packing equal circles in a square: A deterministic global optimization approach
- A hybrid descent method for global optimization
- Reformulation descent applied to circle packing problems
- DC programming: overview.
- Optimal core-sets for balls
- A hybrid algorithm for the minimum bounding sphere problem
- Disk Packing in a Square: A New Global Optimization Approach
- Nonsmooth Coordination and Geometric Optimization via Distributed Dynamical Systems
- Global optimization on funneling landscapes
This page was built for publication: Spreading points using gradient and tabu