A Minimax Location Problem on a Network

P. M. Dearing and R. L. Francis
Additional contact information
P. M. Dearing: Cornell University, Ithaca, New York
R. L. Francis: The University of Florida, Gainesville, Florida

Transportation Science, 1974, vol. 8, issue 4, 333-343

Abstract: We consider a network model of a system of transportation links, with nodes representing locations of existing facilities, and study the problem of finding a new facility location on the network that minimizes the maximum of linear increasing functions of the “network distances” between the new facility and the existing facilities. The problem is formulated with respect to a metric space which is defined on the network, and a number of properties of the problem are developed. The properties lead to a new, simple algorithm for solving the problem when the network is a tree, and to a new, equivalent spanning tree problem for a general network.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.8.4.333 (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:8:y:1974:i:4:p:333-343

Access Statistics for this article

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