Fast heuristics for large scale covering-location problems

Authors:
Luce Brotcorne;Gilbert Laporte;Frédéric Semet
Affiliations:
LAMIH-ROI, Université de Valenciennes, Le Mont Houy, Valenciennes Cedex 9, France;École des Hautes études Commerciales, 3000 Chemin de la Côte-Sainte-Catherine, Montréal, Canada;LAMIH-ROI, Université de Valenciennes, Le Mont Houy, Valenciennes Cedex 9, France and GRIS, Département d'administration de la santé, Université de Montréal, Case postale ...
Venue:
Computers and Operations Research - Location analysis
Year:
2002

Citing 0
Cited 4

A multiperiod set covering location model for dynamic redeployment of ambulances

Computers and Operations Research
Coverage models in military operations

CIT'11 Proceedings of the 5th WSEAS international conference on Communications and information technology
Computational challenges with cliques, quasi-cliques and clique partitions in graphs

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
An object oriented approach for the discertization process

ACA'12 Proceedings of the 11th international conference on Applications of Electrical and Computer Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.