Minimax Location of a Facility in a Network

A. J. Goldman
Additional contact information
A. J. Goldman: National Bureau of Standards, Washington, D.C.

Transportation Science, 1972, vol. 6, issue 4, 407-418

Abstract: The problem is that of locating a facility in a network N so as to minimize the largest of its distances from the vertices of N . A method is given that either solves the problem, or else reduces it to an analogous problem for a single “cyclic component” of N . When N is acyclic (a tree), a very efficient solution algorithm results. Partial analogs of these results are given for a “weighted-distance” extension of the problem.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.6.4.407 (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:6:y:1972:i:4:p:407-418

Access Statistics for this article

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