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 propose a covering problem where the covering radius of a facility is controlled by the decision-maker; the cost of achieving a certain covering distance is assumed to be a monotonically increasing function of the distance (i.e., it costs more to establish a facility with a...

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...