Algorithms for the set covering problem

Authors
Caprara, A Toth, P Fischetti, M
Citation
A. Caprara et al., Algorithms for the set covering problem, ANN OPER R, 98, 2000, pp. 353-371
Citations number
26
Categorie Soggetti
Engineering Mathematics
Journal title
ANNALS OF OPERATIONS RESEARCH
ISSN journal
02545330 → ACNP
Volume
98
Year of publication
2000
Pages
353 - 371
Database
ISI
SICI code
0254-5330(2000)98:<353:AFTSCP>2.0.ZU;2-8
Abstract
The Set Covering Problem (SCP) is a main model for several important applic ations, including crew scheduling in railway and mass-transit companies. In this survey, we focus our attention on the most recent and effective algor ithms fur SCP, considering both heuristic and exact approaches, outlining t heir main characteristics and presenting an experimental comparison on the test-bed instances of Beasley's OR Library.