On packing and covering polyhedra of consecutive ones circulant clutters

DOI10.1016/j.dam.2009.05.003zbMath1230.05089OpenAlexW2162833417MaRDI QIDQ987683

Néstor E. Aguilera

Publication date: 13 August 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.05.003

zbMATH Keywords

polyhedral combinatoricscirculant clutter

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Related Items (7)

Circuits and circulant minors ⋮ Generalized minor inequalities for the set covering polyhedron related to circulant matrices ⋮ Some advances on the set covering polyhedron of circulant matrices ⋮ On dominating set polyhedra of circular interval graphs ⋮ Facet-inducing web and antiweb inequalities for the graph coloring polytope ⋮ The minor inequalities in the description of the set covering polyhedron of circulant matrices ⋮ Lift-and-project ranks of the set covering polytope of circulant matrices

Uses Software

• cdd
• PORTA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notes on ``Ideal 0, 1 matrices by Cornuéjols and Novick
• On the set covering polyhedron of circulant matrices
• A class of facet producing graphs for vertex packing polyhedra
• Ideal 0, 1 matrices
• Near-perfect matrices
• Antiwebs are rank-perfect
• Applying Lehman's theorems to packing problems
• On a certain class of nonideal clutters
• Combinatorial Optimization
• On the width—length inequality

This page was built for publication: On packing and covering polyhedra of consecutive ones circulant clutters