An Algorithm for the M-Median Plant Location Problem

R. S. Garfinkel, A. W. Neebe and M. R. Rao
Additional contact information
R. S. Garfinkel: The University of Rochester, Rochester, New York
A. W. Neebe: The University of Rochester, Rochester, New York
M. R. Rao: The University of Rochester, Rochester, New York

Transportation Science, 1974, vol. 8, issue 3, 217-236

Abstract: The problem is to locate a given number of plants along a road network so as to minimize the total distance between plants and warehouses assigned to them. It is modeled as an integer programming problem and the relaxed LP is solved by decomposition. In cases of noninteger termination, the ILP is attacked using group theoretics and a dynamic programming recursion. Computational results are given, which contrast this procedure to a branch-and-bound approach.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.8.3.217 (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:ortrsc:v:8:y:1974:i:3:p:217-236

Access Statistics for this article

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