On locating a single path-like facility in a general graph
RAIRO - Operations Research - Recherche Opérationnelle (1997)
- Volume: 31, Issue: 2, page 107-115
- ISSN: 0399-0559
Access Full Article
top
How to cite
topPunnen, Abraham P.. "On locating a single path-like facility in a general graph." RAIRO - Operations Research - Recherche Opérationnelle 31.2 (1997): 107-115. <http://eudml.org/doc/105144>.
@article{Punnen1997,
author = {Punnen, Abraham P.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {location; computational complexity},
language = {eng},
number = {2},
pages = {107-115},
publisher = {EDP-Sciences},
title = {On locating a single path-like facility in a general graph},
url = {http://eudml.org/doc/105144},
volume = {31},
year = {1997},
}
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
PB - EDP-Sciences
VL - 31
IS - 2
SP - 107
EP - 115
LA - eng
KW - location; computational complexity
UR - http://eudml.org/doc/105144
ER -
References
top- 1. A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, The design and analysis of computer algorithms, Addison-Wesley, Amsterdam, 1984. Zbl0326.68005MR413592
- 2. R. A. CUNNINGHAME-GREEN, The absolute centre of a graph, Discrete Applied Mathematics, 1984, 7, pp. 275-283. Zbl0538.90091MR736891
- 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. Zbl0676.90020MR978498
- 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. Zbl0806.90074MR1232611
- 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. MR639598
- 6. J. HOOKER, Solving non-linear single facility network location problems, Operations Research, 1986, 36, pp. 732-743. Zbl0619.90020MR884301
- 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. Zbl0744.90049MR1096193
- 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. Zbl0432.90074MR549138
- 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. Zbl0635.90026MR934626
- 10. N. MEGIDDO, Linear time algorithms for linear programming in R3 and related problems, SIAM Journal of Computing, 1983, 12, pp. 759-776. Zbl0521.68034MR721011
- 11. E. MINIEKA, The optimal location of a path or a tree in a tree network, Networks, 1985, 15, pp. 309-321. Zbl0579.90027MR801492
- 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. Zbl0454.68067MR604866
- 13. M. B. RICHEY, Optimal location of a path or tree on a network with cycles, Networks, 1990, 20, pp. 391-407. Zbl0715.90071MR1058158
- 14. R. RABINOVITCH and A. TAMIR, On tree shaped facility location problem of Minieka, Networks, 1992, 22, pp. 515-522. Zbl0794.90029MR1178860
- 15. P. J. SLATER, On locating a facility to service areas within a network, Operations Research, 1981, 29, pp. 523-531. Zbl0455.90028MR629192
- 16. P. J. SLATER, Locating central paths in a network, Transportation Science, 1982, 16, pp. 1-18.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.