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.

• 저널Management Science · 22(5) · 614–617
• 토픽Facility Location and Emergency Management · Organizational Behavior and Human Resource Management
• DOI10.1287/mnsc.22.5.614
• 저자Robert F. Love