Fast heuristics for large scale covering-location problems

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. 2002 Elsevier Science Ltd. All rights reserved.

• Type: Journal
• Year: 2002
• Where: COR
• Authors: Luce Brotcorne, Gilbert Laporte, Frédéric Semet
• Keywords: COR 2002, Heuristics, Large-scale Covering-location Problems, Potential Location Sites