FINDING TWO-CENTERS OF A TREE: THE CONTINUOUS CASE.

Research output: Contribution to journalArticlepeer-review

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 univariate single-center problems. The resultant algorithm, whose complexity is a linear function of the number of nodes, requires and additional effort of about 25% over the single-center algorithm to locate an optimal par of centers. 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.

Original languageEnglish
Pages (from-to)93-106
Number of pages14
JournalTransportation Science
Volume12
Issue number2
DOIs
StatePublished - 1978

Fingerprint

Dive into the research topics of 'FINDING TWO-CENTERS OF A TREE: THE CONTINUOUS CASE.'. Together they form a unique fingerprint.

Cite this