Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

Michael B. Teitz and Polly Bart
Additional contact information
Michael B. Teitz: University of California, Berkeley, California
Polly Bart: University of California, Berkeley, California

Operations Research, 1968, vol. 16, issue 5, 955-961

Abstract: The generalized vertex median of a weighted graph may be found by complete enumeration or by some heuristic method. This paper investigates alternatives and proposes a method that seems to perform well in comparison with others found in the literature.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (116)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.5.955 (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:16:y:1968:i:5:p:955-961

Access Statistics for this article

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