Solving Nonconvex Planar Location Problems by Finite Dominating Sets
Journal of Global Optimization
A comment on a minmax location problem
Operations Research Letters
| Hi-index | 0.00 |
The problem of finding an optimal location X* minimizing the maximum Euclidean distance to existing facilities is well solved by e.g. the Elzinga-Hearn algorithm. In practical situations X* will however often not be feasible. We therefore suggest in this note a polynomial algorithm which will find an optimal location X^F in a feasible subset X@?@?^2 of the plane.