Geodesic
Two heuristics for the absolute $p$-center problem in graphs
Mathematica slovaca, Tome 38 (1988) no. 3, pp. 227-233
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C99 
@article{MASLO_1988_38_3_a4,
     author = {Plesn{\'\i}k, J\'an},
     title = {Two heuristics for the absolute $p$-center problem in graphs},
     journal = {Mathematica slovaca},
     pages = {227--233},
     year = {1988},
     volume = {38},
     number = {3},
     mrnumber = {977900},
     zbl = {0654.05058},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1988_38_3_a4/}
}
TY  - JOUR
AU  - Plesník, Ján
TI  - Two heuristics for the absolute $p$-center problem in graphs
JO  - Mathematica slovaca
PY  - 1988
SP  - 227
EP  - 233
VL  - 38
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/MASLO_1988_38_3_a4/
LA  - en
ID  - MASLO_1988_38_3_a4
ER  - 
%0 Journal Article
%A Plesník, Ján
%T Two heuristics for the absolute $p$-center problem in graphs
%J Mathematica slovaca
%D 1988
%P 227-233
%V 38
%N 3
%U http://geodesic.mathdoc.fr/item/MASLO_1988_38_3_a4/
%G en
%F MASLO_1988_38_3_a4
Plesník, Ján. Two heuristics for the absolute $p$-center problem in graphs. Mathematica slovaca, Tome 38 (1988) no. 3, pp. 227-233. http://geodesic.mathdoc.fr/item/MASLO_1988_38_3_a4/

[1] CHRISTOFIDES N.: Graрh Theory: an Algorithmic Approach. Academic Press, London, 1975. | MR

[2] DYER M. E., FRIEZE A. M.: A simple heuristic for the p-centre problem. J. Oper. Res. Soc. 35, 1984, 285-288. | MR

[3] GAREY M. R., JOHNSON D. S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979. | MR | Zbl

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

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

[6] HOCHBAUM D. S., SHMOYS D. B.: A unified approach to approximation algorithms for bottleneck problems. J. Assoc. Comput. Mach. 33, 1986, 533-550. | MR

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

[8] 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

[9] MINIEKA E.: The centeгs and medians of a gгaph. Opeгations Res. 25, 1977, 641-650. | MR

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

[11] PLESNÍK J.: A heuristic for thep-center problem in graphs. Discrete Appl. Math. 17, 1987, 263-268. | MR

[12] PLESNÍK J.: On the interchange heuristic for locating centers and medians in a graph. Math. Slovaca, 37, 1987, 209-216. | MR | Zbl

[13] 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

[14] WONG R. T.: Location and netwoгk design. In: Combinatorial Optimization: Annotated Bibliographies (M. O'hEigeaгtaigh, J. K. Lenstra and A. H. G. Rinnooy Kan, eds.), Wiley, New York, 1985, 129-147. | MR