A lagrangian heuristic for set-covering problems, Naval Research Logistics, vol.37, no.1, 1990, pp151-164
In this paper we present a heuristic algorithm for non-unicost set covering problems based upon lagrangean relaxation and subgradient optimisation. Computational results, based upon problems involving up to 1000 rows and 10000 columns, indicate that this heuristic produces better quality results than a number of other heuristics.