Algorithms for the Set Covering Problem

Alberto Caprara, Paolo Toth and Matteo Fischetti

Annals of Operations Research, 2000, vol. 98, issue 1, 353-371

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. Copyright Kluwer Academic Publishers 2000

Date: 2000
References: Add references at CitEc
Citations: View citations in EconPapers (46)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1019225027893 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:98:y:2000:i:1:p:353-371:10.1023/a:1019225027893

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1019225027893

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().