| Article ID: | iaor20102924 |
| Volume: | 37 |
| Issue: | 1 |
| Start Page Number: | 16 |
| End Page Number: | 20 |
| Publication Date: | Jan 2009 |
| Journal: | Operations Research Letters |
| Authors: | Avella Pasquale, Boccia Maurizio, Vasilyev Igor |
| Keywords: | cutting plane algorithms |
In this paper we present a cutting plane algorithm for the Set Covering problem. Cutting planes are generated by running an ‘exact’ separation algorithm over the subproblems defined by suitably small subsets of the formulation constraints. Computational results on difficult small-medium size instances are reported.