×

On locating path- or tree-shaped facilities on networks. (English) Zbl 0806.90074

First the authors consider the problem of locating a single facility successively on a tree and when the network is arbitrary. Then the location of multiple path-shaped or tree-shaped facilities is considered for various problems: center, median, max eccentricity and max distance sum problems. Finally, the authors give a result which represents in a certain sense a generalization of the \(p\)-median theorem.

MSC:

90B80 Discrete location and assignment
90C35 Programming involving graphs or networks
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Hakimi, Oper. Research 13 pp 462– (1965)
[2] Kariv, SIAM J. of Applied Math. 37 pp 513– (1979)
[3] Tansel, Management Science 29 pp 482– (1983)
[4] Morgan, J. of Algorithms 1 pp 247– (1980)
[5] Slater, Transportation Science 16 pp 1– (1982)
[6] Minieka, Networks 15 pp 309– (1985)
[7] Batta, Operations Research 36 pp 84– (1988)
[8] Richey, Networks 20 pp 391– (1990)
[9] and , Computers and Intractability, W. H. Freeman, San Francisco, 1979.
[10] Kruskal, Proc. Amer. Math. Soc. 7 pp 48– (1956)
[11] Locations with Spatial Interactions: Competitive Locations and Games, to appear in Discrete Location Theory, edited by and , John Wiley and Sons, New York.
[12] and , The Generalized p-forest Problem on a Tree Network, Technical Report, Tel Aviv University, September 1990.
[13] and , Maximizing the Sum of Node Distances to a Tree-Shaped Facility of a Given Length in a Tree Network, preprint, August 1990.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.