Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

COR
2002

favoriteEmaildiscussreport

58views more COR 2002»

Fast heuristics for large scale covering-location problems

13 years 10 months ago

Fast heuristics for large scale covering-location problems

Download www.univ-valenciennes.fr

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.

Luce Brotcorne, Gilbert Laporte, Fréd&eacut

Real-time Traffic

COR 2002 | Heuristics | Large-scale Covering-location Problems | Potential Location Sites |

claim paper

Related Content

» PRecIDCM3 A Parallel Framework for Fast and Accurate Large Scale Phylogeny Reconstruction

» Fast Algorithms for Bayesian Uncertainty Quantification in LargeScale Linear Inverse Probl...

» LargeScale Data Analysis Using Heuristic Methods

» RecIDCM3 A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees

» Implementation of Approximation Algorithms for the Multicast Congestion Problem

» Large scale clustering of protein sequences with FORCE A layout based heuristic for weight...

» A large neighbourhood search approach to the multiactivity shift scheduling problem

» Scaling up Heuristic Planning with Relational Decision Trees

» Fast shortest path distance estimation in large networks

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	COR
Authors	Luce Brotcorne, Gilbert Laporte, Frédéric Semet

Comments (0)