scientific article; zbMATH DE number 913711

MaRDI QIDQ4887837zbMATH OpenFDO

Authors D. J. White

Publication date 6 August 1996

zbMATH Keywords

weighted maxmin dispersion problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Convex programming (90C25)

Recommendations

• Heuristic and Special Case Algorithms for Dispersion Problems
• scientific article; zbMATH DE number 36716
• scientific article; zbMATH DE number 177561
• Convex relaxations of the weighted maxmin dispersion problem
• A heuristic for solving the maximum dispersion problem

Cited in

(15)

• 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
• A hybrid heuristic for the maximum dispersion problem
• An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem
• New approximation algorithms for weighted maximin dispersion problem with box or ball constraints
• Covering a simplex by spheres: complexity and algorithms
• The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
• On the ball-constrained weighted maximin dispersion problem
• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
• A multiple‐objective dispersion problem
• Heuristic solution approaches for the maximum minsum dispersion problem
• Convex relaxations of the weighted maxmin dispersion problem
• Zeroth-order single-loop algorithms for nonconvex-linear minimax problems
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• Exact algorithms for the max-min dispersion problem

This page was built for publication:

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