A Round-Trip Location Problem on a Tree Graph

Albert W. Chan and Richard L. Francis
Additional contact information
Albert W. Chan: University of Windsor, Windsor, Ontario, Canada
Richard L. Francis: The University of Florida, Gainesville, Florida

Transportation Science, 1976, vol. 10, issue 1, 35-51

Abstract: The problem considered is to locate one new facility with respect to a finite number of pairs of existing facilities on, a tree graph, which typically represents a road network, so as to minimize the maximum cost, where cost are linear increasing functions of the round-trip distance a vehicle based at the new facility travels via a pair of existing facilities. Based on an attainable lower bound for the minimax problem, an algorithm is developed that yields all optimal solutions to the problem.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.10.1.35 (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:10:y:1976:i:1:p:35-51

Access Statistics for this article

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