On packing and covering polyhedra of consecutive ones circulant clutters
From MaRDI portal
Publication:987683
DOI10.1016/J.DAM.2009.05.003zbMATH Open1230.05089OpenAlexW2162833417MaRDI QIDQ987683FDOQ987683
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
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
- A class of facet producing graphs for vertex packing polyhedra
- On the set covering polyhedron of circulant matrices
- Title not available (Why is that?)
- Ideal 0, 1 matrices
- Antiwebs are rank-perfect
- Applying Lehman's theorems to packing problems
- Combinatorial optimization. Packing and covering
- On the width—length inequality
- Title not available (Why is that?)
- Near-perfect matrices
- On a certain class of nonideal clutters
- Notes on ``Ideal 0, 1 matrices by Cornuéjols and Novick
- Title not available (Why is that?)
Cited In (11)
- On \(k^+\)-neighbour packings and one-sided Hadwiger configurations
- Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord.
- Circuits and circulant minors
- Generalized minor inequalities for the set covering polyhedron related to circulant matrices
- Facet-inducing web and antiweb inequalities for the graph coloring polytope
- On dominating set polyhedra of circular interval graphs
- Lift-and-project ranks of the set covering polytope of circulant matrices
- The minor inequalities in the description of the set covering polyhedron of circulant matrices
- Title not available (Why is that?)
- Some advances on the set covering polyhedron of circulant matrices
- Arithmetic relations in the set covering polyhedron of circulant clutters
Uses Software
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)
