Algorithms for the Set Covering Problem |
| |
| Authors: | Alberto Caprara Paolo Toth Matteo Fischetti |
| |
| Affiliation: | (1) DEIS, University of Bologna, Viale Risorgimento 2, I-40136 Bologna, Italy;(2) DEI, University of Padova, Via Gradenigo 6/A, I-35131 Padova, Italy |
| |
| Abstract: | ![]()
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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
