In this paper we consider minisum and minimax single facility location problems where the effective service distance becomes a constant when the actual distance attains or exceeds a certain value. Properties of these problems are studied, and algorithms for their solution are presented.
['Zvi Drezner', 'Avram Mehrez', 'George O. Wesolowsky']
The Facility Location Problem with Limited Distances