Note--One-Dimensional Facility Location-Allocation using Dynamic Programming
A dynamic programming algorithm is presented to locate m variable facilities in relation to n existing facilities situated on one route. Each of the n existing facilities has a requirement flow which must be supplied by the variable facilities. The algorithm does the allocation simultaneously with the location. Computational experience indicates that relatively large problems may be solved optimally.
Year of publication: |
1976
|
---|---|
Authors: | Love, Robert F. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 22.1976, 5, p. 614-617
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Computational algorithm for the location of facilities by nonlinear programming
Love, Robert F., (1968)
-
Mathematical models of road travel distances
Love, Robert F., (1979)
-
A two-station stochastic inventory model with exact methods of computing optimal policies
Love, Robert F., (1967)
- More ...