Minimax Location of a Facility in an Undirected Tree Graph

G. Y. Handler
Additional contact information
G. Y. Handler: Massachusetts Institute of Technology, Cambridge, Massachusetts

Transportation Science, 1973, vol. 7, issue 3, 287-293

Abstract: This paper is addressed to the problem of locating the absolute and vertex centers (minimax criterion) of an undirected tree graph. Based upon a convexity property of the criterion function a very simple and efficient algorithm is offered that locates the minimax point by locating first a maximax point. The minimax is at the mid-point of the maximum path from the maximax point. The vertex center is located simultaneously.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.7.3.287 (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:7:y:1973:i:3:p:287-293

Access Statistics for this article

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