An efficient heuristic for large set covering problems

1 March 1984

journal article
research article
Published by Wiley in Naval Research Logistics Quarterly

Vol. 31 (1) , 163-171
https://doi.org/10.1002/nav.3800310118

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.

Keywords

SET COVERING PROBLEM

This publication has 8 references indexed in Scilit:

Worst case analysis of a class of set covering heuristics
Mathematical Programming, 1982
Efficient heuristic algorithms for the weighted set covering problem
Computers & Operations Research, 1981
A Greedy Heuristic for the Set-Covering Problem
Mathematics of Operations Research, 1979
Interval estimation of a global optimum for large combinatorial problems
Naval Research Logistics Quarterly, 1979
A Dual-Based Procedure for Uncapacitated Facility Location
Operations Research, 1978
Reducibility among Combinatorial Problems
Published by Springer Nature ,1972
Computer Solutions to Minimum-Cover Problems
Operations Research, 1969
Limiting forms of the frequency distribution of the largest or smallest member of a sample
Mathematical Proceedings of the Cambridge Philosophical Society, 1928