On packing and covering polyhedra of consecutive ones circulant clutters

DOI10.1016/J.DAM.2009.05.003MaRDI QIDQ987683zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 3919215
• scientific article; zbMATH DE number 3907275
• scientific article; zbMATH DE number 3971633
• scientific article; zbMATH DE number 431993
• On the integral dicycle packings and covers and the linear ordering polytope
• On packing and covering polyhedra in infinite dimensions
• Simultaneous packing and covering in the Euclidean plane
• scientific article; zbMATH DE number 480248
• The simultaneous packing and covering constants in the plane

Cites work

• scientific article; zbMATH DE number 16723 (Why is no real title available?)
• scientific article; zbMATH DE number 2196279 (Why is no real title available?)
• scientific article; zbMATH DE number 3032896 (Why is no real title available?)
• A class of facet producing graphs for vertex packing polyhedra
• Antiwebs are rank-perfect
• Applying Lehman's theorems to packing problems
• Combinatorial optimization. Packing and covering
• Ideal 0, 1 matrices
• Near-perfect matrices
• Notes on ``Ideal 0, 1 matrices by Cornuéjols and Novick
• On a certain class of nonideal clutters
• On the set covering polyhedron of circulant matrices
• On the width—length inequality

Cited in

(11)

• On \(k^+\)-neighbour packings and one-sided Hadwiger configurations
• The minor inequalities in the description of the set covering polyhedron of circulant matrices
• On dominating set polyhedra of circular interval graphs
• Some advances on the set covering polyhedron of circulant matrices
• Arithmetic relations in the set covering polyhedron of circulant clutters
• Facet-inducing web and antiweb inequalities for the graph coloring polytope
• Lift-and-project ranks of the set covering polytope of circulant matrices
• Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord.
• scientific article; zbMATH DE number 1234829 (Why is no real title available?)
• Circuits and circulant minors
• Generalized minor inequalities for the set covering polyhedron related to circulant matrices

Describes a project that uses

Uses Software

• cdd
• PORTA

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987683)