Strength of facets for the set covering and set packing polyhedra on circulant matrices
From MaRDI portal
Publication:2840523
DOI10.1016/j.endm.2009.11.019zbMath1268.05155OpenAlexW1990060107MaRDI QIDQ2840523
No author found.
Publication date: 19 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.019
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Cites Work
- The nonidealness index of rank-ideal matrices
- On the set covering polyhedron of circulant matrices
- On certain polytopes associated with graphs
- Worst-case comparison of valid inequalities for the TSP
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Stable Set Polytopes for a Class of Circulant Graphs