Finding Two-Centers of a Tree: The Continuous Case

Gabriel Y. Handler
Additional contact information
Gabriel Y. Handler: Tel Aviv University, Tel Aviv, Israel

Transportation Science, 1978, vol. 12, issue 2, 93-106

Abstract: An efficient algorithm for finding the absolute single-center (minimax-distance criterion) of a tree is extended to the location of two-centers, where these may be located anywhere on the continuum of points defined by the tree network. A graph-theoretic analysis transforms this bivariate problem into three unwariaie single-center problems. The resultant algorithm, whose complexity is a linear function of the number of nodes, requires an additional effort of about 25% over the single-center algorithm to locate an optimal pair of venters. Two varieties of the problem are considered; in the first, demand for service can occur anywhere on the network; in the second, demand is restricted to the set of nodes.

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

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.12.2.93 (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:12:y:1978:i:2:p:93-106

Access Statistics for this article

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