Article ID Journal Published Year Pages File Type
1143430 Operations Research Letters 2009 5 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Computational experience with general cutting planes for the Set Covering problem
Authors
, , ,