An efficient heuristic for large set covering problems
Francis Joseph Vasko · Naval Research Logistics Quarterly · 1984
Abstract A heuristic solution procedure for set covering is presented that works well for large, relatively dense problems. In addition, a confidence interval is established about the unknown global optimum. Results are presented for 30 large randomly generated problems.