The problem of locating facilities in a feasible area covering some parts of network links within a given radius is analyzed. The feasible area can be the interior (convex hull of the nodes) of a planar network or any union of convex polygons. Both minimization and maximization of coverage are...

Consider the need to currently locate p facilities but it is possible that up to q additional facilities will have to be located in the future. There are known probabilities that 0 [less-than-or-equals, slant] r [less-than-or-equals, slant] q facilities will need to be located. The...

In this paper we introduce a new objective function for the minimax location problem. Every demand point generates demand for service with a given probability (during a given period of time) and the objective is to minimize the expected maximum distance. The planar problem is proven to be convex...