no. 1
Heuristic methods for the p-center problem
RAIRO - Operations Research - Recherche Opérationnelle, Tome 25 (1991) no. 1, pp. 65-72. 
@article{RO_1991__25_1_65_0,
     author = {Pelegrin, Blas},
     title = {Heuristic methods for the $p$-center problem},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {65--72},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {1},
     year = {1991},
     mrnumber = {1110775},
     zbl = {0732.90056},
     language = {en},
     url = {http://www.numdam.org/item/RO_1991__25_1_65_0/}
}
TY  - JOUR
AU  - Pelegrin, Blas
TI  - Heuristic methods for the $p$-center problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1991
SP  - 65
EP  - 72
VL  - 25
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_1991__25_1_65_0/
LA  - en
ID  - RO_1991__25_1_65_0
ER  - 
%0 Journal Article
%A Pelegrin, Blas
%T Heuristic methods for the $p$-center problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1991
%P 65-72
%V 25
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/RO_1991__25_1_65_0/
%G en
%F RO_1991__25_1_65_0
Pelegrin, Blas. Heuristic methods for the $p$-center problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 25 (1991) no. 1, pp. 65-72. http://www.numdam.org/item/RO_1991__25_1_65_0/

1. Y. P. Aneja, R. Chandrasekaran and K. P. K. Nair, A Note on the m-Center Problem with Rectilinear Distances, European J. Oper. Res., 1988, 35, pp. 118-123. | MR | Zbl

2. C. Charalambuous, Extension of the Elzinga and Hearn Algorithm to the Weighted Case , Oper. Res., 1983, 30, pp. 591-594. | Zbl

3. L. Cooper, Heuristic Methods for Location-Allocation Problems, S.I.A.M. Review, 1964, 6, pp. 37-52. | MR | Zbl

4. L. Cooper, N-Dimensional Location Models: An Application to Cluster Analysis, J. Regional Science, 1973, 13, pp. 41-54.

5. P. M. Dearing and R. L. Francis, A Minimax Location Problem on a Network, Transportation Science, 1974, 8, pp. 333-343. | MR

6. Z. Drezner, The p-Center Problem, Heuristics and Optimal Algorithms, J. Oper. Res. Society, 1984, 35, pp. 741-748. | Zbl

7. Z. Drezner, On the Rectangular p-Center Problem, Naval Research Logistics, 1987, 34, pp. 229-234. | MR | Zbl

8. Z. Drezner and G. O. Wesolowsky, Single Facility Ip-Distance Minimax Location, S.I.A.M. J. of Algebraic and Discrete Methods, 1980, 1, pp. 315-321. | MR | Zbl

9. M. E. Dyer and A. M. Frieze, A Simple Heuristic for the p-Center Problem, Oper. Res. Letters, 1985, 3, pp. 285-288. | MR | Zbl

10. H. A. Eiselt and G. Charlesworth, A Note on p-Center Problems in the Plane, Transportation Science, 1986, 20, pp. 130-133. | MR | Zbl

11. R. L. Francis and J. A. White, Facility Layout and Location: an Analytical Approach, Pretince Hall, 1974.

12. R. S. Garfinkel, A. W. Neebe and M. R. Rao, The m-Center Problem: Minimax Facility Location, Management Science, 1977, 23, pp. 1133-1142. | Zbl

13. S. L. Hakimi, E. F. Schmeichel and J. G. Pierce, On p-Centers in Network, Transportation Science, 1978, 12, pp. 1-15. | MR

14. G. Y. Handler, Complexity and Efficiency in Minimax Network Location, in Combinatorial Optimization, Christofïdes and Mingozzi Ed., 1979, pp. 281-314. | Zbl

15. G. Y. Handler and P. B. Mirchandani, Location in Networks, M.I.T. Press, Cambridge, 1979. | MR

16. D. S. Hochbaum and D. B. Shmoys, A Best Possible Heuristic for the k-Center Problem, Math. Oper. Res., 1985, 10, pp. 180-184. | MR | Zbl

17. W. L. Hsu and G. L. Nemhauser, Easy and Hard Bottleneck Location Problems, Discrete Appl. Math., 1979, 1, pp. 209-216. | MR | Zbl

18. O. Kariv and S. L. Hakimi, An Algorithmic Approach to Network Location Problems, S I.A.M. J. Applied Math., 1979, 37, pp. 513-538. | MR | Zbl

19. S. Masuyama, T. Ibaraki and T. Hasegawa, The Computational Complexity of the m-Center Problem on the Plane. Transaction of the IECE of Japan E 64/2, 1981, 2, pp.57-64.

20. N. Megiddo and K. J. Supowit, On the Complexity of Some Common Geometric Location Problems, S.I.A.M. J, of Cornp., 1984, 13, pp. 182-196. | MR | Zbl

21. E. Minieka, A Polynomial Time Algorithm for Finding the Absolute Center of a Network, Networks, 1981, 11, pp. 351-355. | MR | Zbl

22. B. Pelegrin, General Approach for the 1-Center Problem, Cahiers du Centre d'Etudes de Recherche Opérationnelle, 1986, 28, pp. 293-302, | MR | Zbl

23. B. Pelegrin, The p-Center Problem Under Bidirectional Polyhedral Norms, in Proceedings III Meeting E.W.G. on Locational Analysis, pp. 151-169, Sevilla (Spain), 1988.

24. B. Pelegrin, The p-Center Problem in Rn with Weighted Tchebycheff Norms, Working paper, Dpto. Matemática Aplicada y Estadística, 1990, J, Oper. Res. Society (submitted).

25. J. Plesnik, A Heuristic for the p-Center Problem in Graphs, Discr. Appl. Math., 1987, 17, pp.263-268. | MR | Zbl

26. H. Späth, Computational Experience with the Exchange method, European J. Oper. Res., 1977, 1, pp. 23-31. | Zbl

27. H. Späth, Cluster Disection and Analysis, Ellis Horwood Limited, 1985. | Zbl

28. H. B. Teitz and P. Bart, Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph, Operat. Res., 1968, 16, pp. 955-961. | Zbl

29. J. Vijay, An Algorithm for the p-Center Problem in the Plane, Transportation Science, 1985, 19, pp. 235-245. | Zbl

30. C. D. T. Watson-Gandy, The Multi-Facility Minimax Weber Problem, European J. Oper. Res., 1984, 18, pp. 44-50. | MR | Zbl