A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES

Abstract

The multifacility minimax location problem with rectilinear distances is considered. It is reduced to a parametric' shortest path problem in a network with no negative length arcs. The reduction scheme contributes to this location problem and yields an efficient algorithm with time complexity 0(n max(m log m, n^3)) where n and m denote the numbers of the new and existing facilities in the plane, respectively. For a special case the time bound is further reducible to 0(n max(m, n^2)).