The minor inequalities in the description of the set covering polyhedron of circulant matrices (Q2441576)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6273565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minor inequalities in the description of the set covering polyhedron of circulant matrices |
scientific article; zbMATH DE number 6273565 |
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
0.9220811128616332
0 references
0.9201175570487976
0 references
0.8793942332267761
0 references
0.816699206829071
0 references
