Algorithms for the Set Covering Problem

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.

[1]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[2]  E. Balas.  A class of location, distribution and scheduling problems : modeling and solution methods , 1982 .

[3]  J. Beasley.  A lagrangian heuristic for set‐covering problems , 1990 .

[4]  Matteo Fischetti,et al.  Algorithms for railway crew management , 1997, Math. Program..

[5]  J. Beasley,et al.  Enhancing an algorithm for set covering problems , 1992 .

[6]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[7]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[8]  Ellis L. Johnson,et al.  Solving Large Scale Crew Scheduling Problems , 1997 .

[9]  Egon Balas,et al.  A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..

[10]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[11]  Antonio Sassano,et al.  A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..

[12]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[13]  Michael J. Todd,et al.  Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[14]  Michael J. Brusco,et al.  A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problems , 1999, Ann. Oper. Res..

[15]  Dag Wedelin,et al.  An algorithm for large scale 0–1 integer programming with application to airline crew scheduling , 1995, Ann. Oper. Res..

[16]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[17]  Antonio Sassano,et al.  A Separation Routine for the Set Covering Polytope , 1992, IPCO.

[18]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[19]  J. Beasley.  An algorithm for set covering problem , 1987 .

[20]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[21]  L. A. Lorena,et al.  A surrogate heuristic for set covering problems , 1994 .

[22]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[23]  L. W. Jacobs,et al.  Note: A local-search heuristic for large set-covering problems , 1995 .

[24]  David Avis,et al.  SET COVERING PROBLEMS , 1980 .

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[26]  Salim Haddadi,et al.  Simple Lagrangian heuristic for the set covering problem , 1997 .