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

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 paper considers the problem of locating a single facility in the presence of a line barrier that occurs randomly on a given horizontal route on the plane. The objective is to locate this new facility such that the sum of the expected rectilinear distances from the facility to the demand...