Note--Single and Double Vertex Substitution in Heuristic Procedures for the p-Median Problem

Samuel Eilon and Roberto D. Galvão
Additional contact information
Samuel Eilon: Imperial College of Science and Technology, London
Roberto D. Galvão: Universidade Federal do Rio de Janiero

Management Science, 1978, vol. 24, issue 16, 1763-1766

Abstract: The p-median problem is an uncapacitated minisum network location problem where it is required to site p facilities in a network, so that the sum of the shortest distances from each of the nodes of the network to its nearest facility is minimized. An existing heuristic procedure for this problem is extended, and computational experience is provided for several cases. A simple vertex addition heuristic and its use as a "pre-processor" to the extended procedure is described and tested for a number of problems.

Keywords: p-median; heuristic (search for similar items in EconPapers)
Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.16.1763 (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:24:y:1978:i:16:p:1763-1766

Access Statistics for this article

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