The minor inequalities in the description of the set covering polyhedron of circulant matrices (Q2441576)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minor inequalities in the description of the set covering polyhedron of circulant matrices |
scientific article |
Statements
The minor inequalities in the description of the set covering polyhedron of circulant matrices (English)
0 references
25 March 2014
0 references
This paper presents two families of circulant matrices for which the set covering polyhedron can be described by boolean facets and minor inequalities. A polynomial time separation algorithm based on linear programming is provided for these inequalities.
0 references
polyhedral combinatorics
0 references
set covering
0 references
circulant matrices
0 references
0 references
