Note--One-Dimensional Facility Location-Allocation using Dynamic Programming

Robert F. Love
Additional contact information
Robert F. Love: University of Wisconsin, Madison

Management Science, 1976, vol. 22, issue 5, 614-617

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

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.22.5.614 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:22:y:1976:i:5:p:614-617

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().