Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

The results show the algorithm to be more reliable and efficient than earlier procedures on large, sparse set covering problems.