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

This paper extends the static single facility location problem to a model that permits location changes within a planning horizon of r periods. An algorithm is developed to optimize the sequence of locations in order to meet changes in costs, volumes and locations of destinations.

This note deals with the one-dimensional facility location model in which the weights, which can represent either demand volumes or demands and costs combined, are known only probabilistically. The demand points themselves, or at least the "feeder" routes to the demand points, for the facility...

Rejoinder to the previous note (Erlenkotter, D. 1974. Note--Dynamic facility location and simple network models. Management Sci. 20 (9) 1311.).

A dynamic or multiperiod location-allocation formulation is developed from the static problem of locating G facilities among M possible sites to serve N demand points. This dynamic model provides a tool for analyzing tradeoffs among present values of static distribution costs in each period and...

This paper presents a new experimental approach to the Weber problem in the presence of convex barriers by using the Varignon frame. The Varignon frame is a mechanical system of strings, weights and a board with holes that has been used to identify an optimal location for the classical Weber...