Ravi, S.S., Rosenkrantz, D.J. and Tayi, G.K. (1994) Heuristic and Special Case Algorithms for Dispersion Problems. Operations Research, 42, 299-310.
https://doi.org/10.1287/opre.42.2.299

has been cited by the following article:

• TITLE: An Efficient Random Algorithm for Box Constrained Weighted Maximin Dispersion Problem

  AUTHORS: Jinjin Huang

  KEYWORDS: Maximin Dispersion Problem, Successive Convex Approximation Algorithm, Quadratically Constrained Quadratic Programming (QCQP)

  JOURNAL NAME: Advances in Pure Mathematics, Vol.9 No.4, April 11, 2019

  ABSTRACT: The box-constrained weighted maximin dispersion problem is to find a point in an n-dimensional box such that the minimum of the weighted Euclidean distance from given m points is maximized. In this paper, we first reformulate the maximin dispersion problem as a non-convex quadratically constrained quadratic programming (QCQP) problem. We adopt the successive convex approximation (SCA) algorithm to solve the problem. Numerical results show that the proposed algorithm is efficient.