An efficient heuristic for large set covering problems

Francis J. Vasko

Naval Research Logistics Quarterly, 1984, vol. 31, issue 1, 163-171

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.

Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
https://doi.org/10.1002/nav.3800310118

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:wly:navlog:v:31:y:1984:i:1:p:163-171

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().