An algorithm for set covering problems, European Journal of Operational Research, vol.31, 1987, pp85-93
In this paper we present an algorithm for the set covering problem that combines problem reduction tests with dual ascent, subgradient optimisation and linear programming. Computational results are presented for problems involving up to 400 rows and 4000 columns.
Full paper from ScienceDirect
J E Beasley