New heuristic algorithms for the rectangular p-cover problem
RAIRO - Operations Research - Recherche Opérationnelle, Tome 29 (1995) no. 1, pp. 73-91. 
@article{RO_1995__29_1_73_0,
     author = {Pelegr{\'\i}n, B. and C\'anovas, L.},
     title = {New heuristic algorithms for the rectangular $p$-cover problem},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {73--91},
     publisher = {EDP-Sciences},
     volume = {29},
     number = {1},
     year = {1995},
     mrnumber = {1321541},
     zbl = {0835.90041},
     language = {en},
     url = {http://www.numdam.org/item/RO_1995__29_1_73_0/}
}
TY  - JOUR
AU  - Pelegrín, B.
AU  - Cánovas, L.
TI  - New heuristic algorithms for the rectangular $p$-cover problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1995
SP  - 73
EP  - 91
VL  - 29
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_1995__29_1_73_0/
LA  - en
ID  - RO_1995__29_1_73_0
ER  - 
%0 Journal Article
%A Pelegrín, B.
%A Cánovas, L.
%T New heuristic algorithms for the rectangular $p$-cover problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1995
%P 73-91
%V 29
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/RO_1995__29_1_73_0/
%G en
%F RO_1995__29_1_73_0
Pelegrín, B.; Cánovas, L. New heuristic algorithms for the rectangular $p$-cover problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 29 (1995) no. 1, pp. 73-91. http://www.numdam.org/item/RO_1995__29_1_73_0/

1. L. Cooper, N-dimensional Location Models: An application to Cluster Analysis, J. Regional Science, 1973, 13, pp. 41-54.

2. Z. Drezner, The p-center problem, Heuristics and Optimal algorithms, J. Oper. Res. Society, 1984, 35, pp. 741-748. | Zbl

3. Z. Drezner, On the complexity of the exchange algorithm for minimax optimization problems, Math. Programming, 1987, 38, pp. 219-222. | MR | Zbl

4. Z. Drezner, G. O. Wesolowsky, Single facility Lp distance minimax location, SIAM J. of Algebraic and Discrete Methods, 1980, 1, pp. 315-321. | MR | Zbl

5. F. Plastria, Solving general continuous single facility location problems by cutting planes, EJOR, 1987, 29, pp. 98-110. | MR | Zbl

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

7. H. A. Eiselt, G. Charlesworth, A note on p-center problems in the plane, Transportation Science, 1986, 20, pp. 130-133. | MR | Zbl

8. J. Elzinga, D. W. Hearn, Geometrical solutions for some minimax location problems, Transportation Science, 1972, 6, pp. 379-394. | MR

9. J. Elzinga, D. W. Hearn, The Minimum Covering Sphere Problem, Management Science, 1972, 19, pp. 96-104. | MR | Zbl

10. R. L. Francis, J. A. White, Facility Layout and Location: An analytical approach, Prentice-Hall, 1974.

11. W. L. Hsu, G. L. Nemhauser, Easy and Hard bottleneck location problems, Discrete Appl. Math., 1979, 1, pp. 209-216. | MR | Zbl

12. N. Meggido, K. J. Supowit, On the complexity of some common geometric location problems, SIAM J. Computing 1984, 18, pp. 182-196. | MR | Zbl

13. B. Pelegrin, The p-center prolem in Rn with weighted Tchebycheff norms, JORBEL, 1991, a, 31, pp. 49-62. | Zbl

14. B. Pelegrin, Heuristic methods for the p-center problem, RAIRO, 1991 b, 25, pp. 65-72. | Numdam | MR | Zbl

15. B. Pelegrin, L. Canovas, A computational study of some heuristic algorithms for the p-center problem with weighted Tchebycheff norms, 1991 c, Presented at OR33 in Exeter, September 1991. United Kingdom.

16. J. Plesnik, A heuristic for the p-center problem in graphs, Discrete Applied Mathematics, 17, pp. 263-268. | MR | Zbl