| Article ID: | iaor20023137 |
| Country: | United Kingdom |
| Volume: | 29 |
| Issue: | 6 |
| Start Page Number: | 651 |
| End Page Number: | 665 |
| Publication Date: | May 2002 |
| Journal: | Computers and Operations Research |
| Authors: | Laporte Gilbert, Semet Frdric, Brotcorne Luce |
| Keywords: | heuristics, graphs |
We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These heuristics are compared on a set of 152 real-life instances arising in cytological screening.