New heuristic algorithms for the rectangular -cover problem
RAIRO - Operations Research - Recherche Opérationnelle (1995)
- Volume: 29, Issue: 1, page 73-91
- ISSN: 0399-0559
Access Full Article
top
How to cite
topPelegrín, B., and Cánovas, L.. "New heuristic algorithms for the rectangular $p$-cover problem." RAIRO - Operations Research - Recherche Opérationnelle 29.1 (1995): 73-91. <http://eudml.org/doc/105098>.
@article{Pelegrín1995,
author = {Pelegrín, B., Cánovas, L.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {clustering; unweighted -center; Tchebycheff norm; rectangular - cover problem; heuristic},
language = {eng},
number = {1},
pages = {73-91},
publisher = {EDP-Sciences},
title = {New heuristic algorithms for the rectangular $p$-cover problem},
url = {http://eudml.org/doc/105098},
volume = {29},
year = {1995},
}
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
PB - EDP-Sciences
VL - 29
IS - 1
SP - 73
EP - 91
LA - eng
KW - clustering; unweighted -center; Tchebycheff norm; rectangular - cover problem; heuristic
UR - http://eudml.org/doc/105098
ER -
References
top- 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. Zbl0544.90024
- 3. Z. DREZNER, On the complexity of the exchange algorithm for minimax optimization problems, Math. Programming, 1987, 38, pp. 219-222. Zbl0632.90064MR904589
- 4. Z. DREZNER, G. O. WESOLOWSKY, Single facility Lp distance minimax location, SIAM J. of Algebraic and Discrete Methods, 1980, 1, pp. 315-321. Zbl0501.90031MR586159
- 5. F. PLASTRIA, Solving general continuous single facility location problems by cutting planes, EJOR, 1987, 29, pp. 98-110. Zbl0608.90022MR882825
- 6. M. E. DYER, A. M. FRIEZE, A Simple Heuristic for the p-Center Problem, Oper. Res. Letters, 1985, 3, pp. 285-288. Zbl0556.90019MR797340
- 7. H. A. EISELT, G. CHARLESWORTH, A note on p-center problems in the plane, Transportation Science, 1986, 20, pp. 130-133. Zbl0629.90031MR878973
- 8. J. ELZINGA, D. W. HEARN, Geometrical solutions for some minimax location problems, Transportation Science, 1972, 6, pp. 379-394. MR349226
- 9. J. ELZINGA, D. W. HEARN, The Minimum Covering Sphere Problem, Management Science, 1972, 19, pp. 96-104. Zbl0242.90061MR311316
- 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. Zbl0424.90049MR549500
- 12. N. MEGGIDO, K. J. SUPOWIT, On the complexity of some common geometric location problems, SIAM J. Computing 1984, 18, pp. 182-196. Zbl0534.68032MR731036
- 13. B. PELEGRIN, The p-center prolem in Rn with weighted Tchebycheff norms, JORBEL, 1991, a, 31, pp. 49-62. Zbl0747.90059
- 14. B. PELEGRIN, Heuristic methods for the p-center problem, RAIRO, 1991 b, 25, pp. 65-72. Zbl0732.90056MR1110775
- 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. Zbl0637.05020MR890636
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.