On a certain class of nonideal clutters
From MaRDI portal
Publication:2500534
DOI10.1016/J.DAM.2006.03.027zbMATH Open1097.05012OpenAlexW1995778733MaRDI QIDQ2500534FDOQ2500534
Authors: Gabriela R. Argiroffo, Silvia M. Bianchi, G. Nasini
Publication date: 17 August 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.027
Recommendations
Cites Work
- Bottleneck extrema
- On the 0,1 facets of the set covering polytope
- Applying Lehman's theorems to packing problems
- On the width—length inequality
- Title not available (Why is that?)
- A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
- Graph imperfection. I
- Near-perfect matrices
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- Title not available (Why is that?)
- The disjunctive procedure and blocker duality
- Title not available (Why is that?)
Cited In (13)
- Notes on ``Ideal 0, 1 matrices by Cornuéjols and Novick
- The nonidealness index of rank-ideal matrices
- On the set covering polyhedron of circulant matrices
- On ideal clutters, metrics and multiflows
- Clutter nonidealness
- Ideal clutters
- Minimizing clutter using absence in Venn-\(\text i^{\text e}\)
- On packing and covering polyhedra of consecutive ones circulant clutters
- A Class of Polynomially Solvable Set-Covering Problems
- Imperfect and nonideal clutters: A common approach
- Arithmetic relations in the set covering polyhedron of circulant clutters
- Four results about self-blocking clutters
- Some insight into characterizations of minimally nonideal matrices
This page was built for publication: On a certain class of nonideal clutters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500534)