Computational experience with general cutting planes for the Set Covering problem

Authors:
Pasquale Avella;Maurizio Boccia;Igor Vasilyev
Affiliations:
Dipartimento di Ingegneria, Universití del Sannio, Italy;Dipartimento di Ingegneria, Universití del Sannio, Italy;Institute of System Dynamics and Control Theory, Siberian Branch of Russian Academy of Sciences, Russia
Venue:
Operations Research Letters
Year:
2009

Citing 11
Cited 1

On the 0, 1 facets of the set covering polytope

Mathematical Programming: Series A and B
On the set covering polytope: I. all the facets with coefficients in {0, 1, 2}

Mathematical Programming: Series A and B
On the set covering polytope: II. lifting the facets with coefficients in {0, 1, 2}

Mathematical Programming: Series A and B
Facets and lifting procedures for the set covering polytope

Mathematical Programming: Series A and B
On the facial structure of the set covering polytope dimensional linear programming

Mathematical Programming: Series A and B
A Lagrangian-based heuristic for large-scale set covering problems

Mathematical Programming: Series A and B - Special issue on computational integer programming
A Heuristic Method for the Set Covering Problem

Operations Research
Optimizing over the first Chvátal closure

Mathematical Programming: Series A and B
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Exact solutions to linear programming problems

Operations Research Letters
Solving hard set covering problems

Operations Research Letters

A mixed integer linear program and tabu search approach for the complementary edge covering problem

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

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.