On locating a single path-like facility in a general graph
RAIRO - Operations Research - Recherche Opérationnelle, Tome 31 (1997) no. 2, pp. 107-115.
@article{RO_1997__31_2_107_0,
     author = {Punnen, Abraham P.},
     title = {On locating a single path-like facility in a general graph},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {107--115},
     publisher = {EDP-Sciences},
     volume = {31},
     number = {2},
     year = {1997},
     zbl = {0871.68102},
     mrnumber = {1452338},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1997__31_2_107_0/}
}
TY  - JOUR
AU  - Punnen, Abraham P.
TI  - On locating a single path-like facility in a general graph
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1997
DA  - 1997///
SP  - 107
EP  - 115
VL  - 31
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1997__31_2_107_0/
UR  - https://zbmath.org/?q=an%3A0871.68102
UR  - https://www.ams.org/mathscinet-getitem?mr=1452338
LA  - en
ID  - RO_1997__31_2_107_0
ER  - 
Punnen, Abraham P. On locating a single path-like facility in a general graph. RAIRO - Operations Research - Recherche Opérationnelle, Tome 31 (1997) no. 2, pp. 107-115. http://archive.numdam.org/item/RO_1997__31_2_107_0/

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Amsterdam, 1984. | MR 413592 | Zbl 0326.68005

2. R. A. Cunninghame-Green, The absolute centre of a graph, Discrete Applied Mathematics, 1984, 7, pp. 275-283. | MR 736891 | Zbl 0538.90091

3. S. K. Gupta and A. P. Punnen, Group centre and group median of a network, European Journal of Operational Research, 1989, 38, pp. 94-97. | MR 978498 | Zbl 0676.90020

4. S. L. Hakimi, E. F. Schmeichel and M. Labbe, On locating path or tree shaped facilities on networks, Networks, 1993, 23, pp. 543-555. | MR 1232611 | Zbl 0806.90074

5. S. M. Hedetnieim, E. J. Cockayne and S. T. Hedetmemi, Linear time algorithm for finding the Jordan centre and path centre of a tree, Transportation Science, 1981, 15, pp. 98-114. | MR 639598

6. J. Hooker, Solving non-linear single facility network location problems, Operations Research, 1986, 36, pp. 732-743. | MR 884301 | Zbl 0619.90020

7. J. N. Hooker, R. S. Garfinkel and C. K. Chen, Finite dorninating sets for network location problems, Operations Research, 1991, 39, pp. 100-118. | MR 1096193 | Zbl 0744.90049

8. O. Kariv and S. L. Hakimi, An algorithmic approach to network location problems, Part I: The p-centers, SIAM Journal of Applied Mathematica, 1979, 37, pp. 513-538. | MR 549138 | Zbl 0432.90074

9. R. K. Kincaid, T. J. Lowe and T. L. Morin, The location of central: structures in trees, Computers and Operations Research, 1988, 15, pp. 103-113. | MR 934626 | Zbl 0635.90026

10. N. Megiddo, Linear time algorithms for linear programming in R3 and related problems, SIAM Journal of Computing, 1983, 12, pp. 759-776. | MR 721011 | Zbl 0521.68034

11. E. Minieka, The optimal location of a path or a tree in a tree network, Networks, 1985, 15, pp. 309-321. | MR 801492 | Zbl 0579.90027

12. C. A. Morgan and P. J. Slater, A linear time algorithm for a core of a tree, Journal of Algorithms, 1980, I. pp. 247-258. | MR 604866 | Zbl 0454.68067

13. M. B. Richey, Optimal location of a path or tree on a network with cycles, Networks, 1990, 20, pp. 391-407. | MR 1058158 | Zbl 0715.90071

14. R. Rabinovitch and A. Tamir, On tree shaped facility location problem of Minieka, Networks, 1992, 22, pp. 515-522. | MR 1178860 | Zbl 0794.90029

15. P. J. Slater, On locating a facility to service areas within a network, Operations Research, 1981, 29, pp. 523-531. | MR 629192 | Zbl 0455.90028

16. P. J. Slater, Locating central paths in a network, Transportation Science, 1982, 16, pp. 1-18.