On a certain class of nonideal clutters
From MaRDI portal
Publication:2500534
Recommendations
Cites work
- scientific article; zbMATH DE number 16723 (Why is no real title available?)
- scientific article; zbMATH DE number 3345048 (Why is no real title available?)
- scientific article; zbMATH DE number 2230198 (Why is no real title available?)
- A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
- Applying Lehman's theorems to packing problems
- Bottleneck extrema
- Graph imperfection. I
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- Near-perfect matrices
- On the 0,1 facets of the set covering polytope
- On the width—length inequality
- The disjunctive procedure and blocker duality
Cited in
(16)- On the set covering polyhedron of circulant matrices
- A Class of Polynomially Solvable Set-Covering Problems
- Four results about self-blocking clutters
- The nonidealness index of rank-ideal matrices
- Notes on ``Ideal 0, 1 matrices by Cornuéjols and Novick
- The minimally non-ideal binary clutters with a triangle
- Arithmetic relations in the set covering polyhedron of circulant clutters
- Clutter nonidealness
- Imperfect and nonideal clutters: A common approach
- Minimizing clutter using absence in Venn-\(\text i^{\text e}\)
- Some insight into characterizations of minimally nonideal matrices
- Ideal clutters
- Identically self-blocking clutters
- On packing and covering polyhedra of consecutive ones circulant clutters
- Ideal clutters that do not pack
- On ideal clutters, metrics and multiflows
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)