Geodesic
On the interchange heuristic for locating centers and medians in a graph
Mathematica slovaca, Tome 37 (1987) no. 2, pp. 209-216
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C35, 05C38, 68R10 
@article{MASLO_1987_37_2_a9,
     author = {Plesn{\'\i}k, J\'an},
     title = {On the interchange heuristic for locating centers and medians in a graph},
     journal = {Mathematica slovaca},
     pages = {209--216},
     year = {1987},
     volume = {37},
     number = {2},
     mrnumber = {899438},
     zbl = {0642.05030},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1987_37_2_a9/}
}
TY  - JOUR
AU  - Plesník, Ján
TI  - On the interchange heuristic for locating centers and medians in a graph
JO  - Mathematica slovaca
PY  - 1987
SP  - 209
EP  - 216
VL  - 37
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MASLO_1987_37_2_a9/
LA  - en
ID  - MASLO_1987_37_2_a9
ER  - 
%0 Journal Article
%A Plesník, Ján
%T On the interchange heuristic for locating centers and medians in a graph
%J Mathematica slovaca
%D 1987
%P 209-216
%V 37
%N 2
%U http://geodesic.mathdoc.fr/item/MASLO_1987_37_2_a9/
%G en
%F MASLO_1987_37_2_a9
Plesník, Ján. On the interchange heuristic for locating centers and medians in a graph. Mathematica slovaca, Tome 37 (1987) no. 2, pp. 209-216. http://geodesic.mathdoc.fr/item/MASLO_1987_37_2_a9/

[1] BEHZAD M., CHARTRAND, G, LESNIAK-FOSTER L.: Graphs and Digraphs. Pгindle, Webeг and Schmidt, Boston, 1979. | MR

[2] CHRISTOFIDES N.: Graph Theoгy: an algorithmic approach. Academic Press, London, 1975. | MR

[3] HAKIMI S. L.: Optimal locations of switching centers and the absolute centers and medians of a graph. Operations Res. 12, 1964, 450-459.

[4] HAKIMI S. L.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Operations Res. 13, 1965, 462-475. | MR | Zbl

[5] HALPERN J., MAIMON O.: Algorithms for the m-center problems; a survey. European J. Operational Res. 10, 1982, 90-99. | MR | Zbl

[6] HARARY F.: Graph Theory. Addison-Wesley, Reading, 1969. | MR | Zbl

[7] HOCHBAUM D. S., SHMOYS D. B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10, 1985, 180-184. | MR | Zbl

[8] HOCHBAUM D. S., SHMOYS D. B.: Powers of graphs: a powerfull approximation algorithm technique for bottleneck problems. J. Assoc. Comput. Mach. (to appear).

[9] HSU W. L., NEMHAUSER G. L.: Easy and hard bottleneck location problems. Discrete Appl. Math. 1, 1979, 209-215. | MR | Zbl

[10] JARVINEN P., RAJALA J., SINERVO H.: A branch-and-bound algorithm for seeking the p-median. Operations Res. 20,1972, 173-182.

[11] KARIV O., HAKIMI S. L.: An algorithmic approach to network location problems. I: the p-centers. SIAM J. Appl. Math. 37, 1979, 513-538. | MR | Zbl

[12] KARIV O., HAKIMI S. L.: An algorithmic approach to network location problems. II: the p-medians. SIAM J. Appl. Math. 37, 1979, 539-560. | MR | Zbl

[13] MINIEKA E.: Optimization Algorithms for Networks and Graphs. Marcel Dekker, New York, 1978. | MR | Zbl

[14] MINIEKA E.: The centers and medians of a graph. Operations Res. 25, 1977, 641-650. | MR | Zbl

[15] PLESNIK J.: On the computational complexity of centers locating in a graph. Aplikace Mat. 25, 1980, 445-452. | MR | Zbl

[16] REVELLE C., MARKS D., LIEBMAN J. C.: An analysis of private and public sector location models. Management Sci. 16, 1970, 692-707. | Zbl

[17] TANSEL B. C., FRANCIS R. L., LOWE T. J.: Location on networks: a survey; part I: the p-center and p-median problems. Management Sci. 29, 1983, 482-497. | MR

[18] TANSEL B. C, FRANCIS R. L., LOWE T. J.: Location on networks: a survey; part II: exploiting tree network structure. Management Sci. 29, 1983. 498-511. | MR

[19] TEITZ M. B., BART B.: Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Res. 16, 1968, 955 -961. | Zbl

[20] WONG R. T.: Location and network design. In: Combinatorial Optimization: annotated bibliographies. Wiley, New York, 1985, 129- 147. | MR | Zbl

[21] DYER M. E., FRIEZE A. M.: A simple heuristic for the p-centre problem. Oper. Res. Lett. 3, 1985, 285-288. | MR | Zbl