Minimax location with farthest Euclidean distances

Abstract

This paper considers the locations of facilities in the plane, with the aim of minimizing the maximal weighted distance between facilities and regional customers where the distances between facilities and regional customers are evaluated by the farthest Euclidean distances. We consider both the single-facility case and the multiple-facilities case, and we propose some efficient algorithms. We report some numerical results to verify the efficiency of these algorithms. © 2012 Yokohama Publishers.