| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6898439 | European Journal of Operational Research | 2012 | 8 Pages |
Abstract
⺠p-Median problems with an additional coverage constraint (CONPMP) are studied. ⺠Local search procedures, as well as a multistart GRASP heuristic, are developed. ⺠A Lagrangean relaxation based heuristic is designed for CONPMP. ⺠Computational results show that these procedures are efficient to solve CONPMP. ⺠The model allows to studying the trade off between distance and coverage.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jesús Sáez-Aguado, Paula Camelia Trandafir,