Spreading points using gradient and tabu

DOI10.1007/S43069-023-00214-7MaRDI QIDQ6097431zbMATH OpenOpenAlexFDO

Authors Xiangyang Huang, Liguo Huang

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

zbMATH Keywords

gradientminimum enclosing ballpackingspreadingtabu search

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximation algorithms for spreading points
• Approximation and Online Algorithms
• Beating the spread, time-optimal point meshing
• scientific article; zbMATH DE number 1822177
• Solution adaptive grid strategies based on point redistribution
• A gradient projection algorithm with arbitrary initial point for optimization
• Sparse approximation via generating point sets
• Sparse Approximation via Generating Point Sets
• scientific article; zbMATH DE number 613275
• Approximating a planar convex set using a sparse grid

Cites work

• A hybrid algorithm for the minimum bounding sphere problem
• A hybrid descent method for global optimization
• A literature review on circle and sphere packing problems: models and methodologies
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
• DC programming: overview.
• Disk packing in a square: a new global optimization approach
• Global optimization on funneling landscapes
• scientific article; zbMATH DE number 51950 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 1748533 (Why is no real title available?)
• Improving dense packings of equal disks in a square
• Minimax and maximin space-filling designs: some properties and methods for construction
• Nonsmooth Coordination and Geometric Optimization via Distributed Dynamical Systems
• Optimal core-sets for balls
• Packing equal circles in a square: A deterministic global optimization approach
• Packing unit spheres into the smallest sphere using VNS and NLP
• Packing up to 50 equal circles in a square
• Reformulation descent applied to circle packing problems
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Unsolved problems in geometry

This page was built for publication: Spreading points using gradient and tabu

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097431)