Covering a simplex by spheres: complexity and algorithms

DOI10.1007/s10898-022-01137-zzbMath1492.90143OpenAlexW4213415185MaRDI QIDQ2162517

Yong Xia, Tongli Zhang

Publication date: 8 August 2022

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-022-01137-z

zbMATH Keywords

NP-hardmaximin dispersionsimplex covering

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Uses Software

• CPLEX
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On determining the cover of a simplex by spheres centered at its vertices
• Analytical models for locating undesirable facilities
• Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading
• New approximation algorithms for weighted maximin dispersion problem with box or ball constraints
• On the Ball-Constrained Weighted Maximin Dispersion Problem
• A Maxmin Location Problem
• A Parametric 1-Maximin Location Problem
• Convex Relaxations of the Weighted Maxmin Dispersion Problem

This page was built for publication: Covering a simplex by spheres: complexity and algorithms