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.
|Titolo:||Computational experience with general cutting planes for the Set Covering problem|
|Data di pubblicazione:||2009|
|Appare nelle tipologie:||1.1 Articolo in rivista|