A DISCRETE LOCATION PROBLEM
HOANG TUY, NGUYEN DUC NGHIA, LE SI VINH
An efficient algorithm based on discrete monotonic optimization is proposed for finding the largest ball centered in a given finite― S⊂Rn and disjoint from any of m given balls in Rn.