Technical Note—An Algorithm for the p -Median Problem

Subhash C. Narula, Ugonnaya I. Ogbu and Haakon M. Samuelsson
Additional contact information
Subhash C. Narula: State University of New York, Buffalo, New York
Ugonnaya I. Ogbu: State University of New York, Buffalo, New York
Haakon M. Samuelsson: (Posthumous)

Operations Research, 1977, vol. 25, issue 4, 709-713

Abstract: We present a branch-and-bound algorithm for solving the p -median problem. The bounds are obtained by solving the Lagrangian relaxation of the p -median problem using the subgradient optimization method. The proposed algorithm is simple, requires small core storage and computational time, and can be used for solving large problems. Comparative results are also reported.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.4.709 (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:oropre:v:25:y:1977:i:4:p:709-713

Access Statistics for this article

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