| Article ID: | iaor2002492 |
| Country: | Netherlands |
| Volume: | 98 |
| Issue: | 1 |
| Start Page Number: | 353 |
| End Page Number: | 371 |
| Publication Date: | Dec 2000 |
| Journal: | Annals of Operations Research |
| Authors: | Fischetti Matteo, Toth Paolo, Caprara Alberto |
| Keywords: | programming: integer |
The Set Covering Problem (SCP) is a main model for several important applications, including crew scheduling in railway and mass-transit companies. In this survey, we focus our attention on the most recent and effective algorithms for SCP, considering both heuristic and exact approaches, outlining their main characteristics and presenting an experimental comparison on the test-bed instances of Beasley's OR Library.