Location and sizing of facilities on a line
The authors describe a specific location-allocation problem which differs from the known basic form, which assumes that the number of facilities to be realized are known and their capacities are unlimited. For such models the data basis are (defined) sets of possible facility locations and demand (or customer) nodes spread out in a plane or a network. In this paper attention is given to two modifications, at first the node sets are restricted to a line and second the needed number of facilities and their capacities are introduced in the decision process. For the first modification it is known, that these problems can be solved efficiently using dynamic programming. Adding the second modification a more complex structure appears. The authors show, that it is easier to solve such problems (also by dynamic programming) then those without the additional restrictions.
scientific article; zbMATH DE number 1740555