Enhancing an algorithm for set covering problems

In this note the authors present enhancements to a previously published algorithm for the optimal solution of set covering problems. These enhancements relate to the use of a Lagrangean heuristic, feasible solution exclusion constraints, Gomory f-cuts and an improved branching strategy. Computational results, for problems involving up to 400 rows and 4000 columns, indicate that the enhanced algorithm gives better computational results than the original algorithm.