New approximation algorithms for weighted maximin dispersion problem with box or ball constraints

DOI10.1007/s10957-021-01893-0zbMath1475.90125OpenAlexW3177482650MaRDI QIDQ2046695

Siwen Wang, Zi Xu

Publication date: 18 August 2021

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-021-01893-0

zbMATH Keywords

approximation algorithmNP-hardweighted maximin dispersion problemrandom approximation algorithm

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Covering a simplex by spheres: complexity and algorithms

Cites Work

• Unnamed Item
• Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading
• An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem
• An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem
• On the Ball-Constrained Weighted Maximin Dispersion Problem
• A Maxmin Location Problem
• Heuristic and Special Case Algorithms for Dispersion Problems
• Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications
• Convex Relaxations of the Weighted Maxmin Dispersion Problem

This page was built for publication: New approximation algorithms for weighted maximin dispersion problem with box or ball constraints