Technical Note—A Branch-and-Bound Algorithm for Seeking the P -Median

Pertti Järvinen, Jaakko Rajala and Heikki Sinervo
Additional contact information
Pertti Järvinen: University of Tampere, Finland
Jaakko Rajala: University of Tampere, Finland
Heikki Sinervo: University of Tampere, Finland

Operations Research, 1972, vol. 20, issue 1, 173-178

Abstract: We construct a branch-and-bound algorithm for seeking the p -median, and make comparisons with the vertex-substitution method of Teitz and Bart [ Opns. Res. 16, 955–961 (1968)]. We show how the vertex-substitution method can lead to a local optimum, and give a heuristic method for finding a good initial solution for this method.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.1.173 (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:20:y:1972:i:1:p:173-178

Access Statistics for this article

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