Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Francis J. Vasko (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: