A note on clutter partitions

DOI10.1016/0167-6377(94)90047-7zbMath0810.90094OpenAlexW2160169043MaRDI QIDQ1332941

F. Bruce Shepherd

Publication date: 5 September 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90047-7

zbMATH Keywords

perfect graphsdiscrete optimizationblocking polyhedraminimally nonideal matricescovered and partitionable clutters

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09) Matrices of integers (15B36)

Cites Work

• Unnamed Item
• Unnamed Item
• Lehman's forbidden minor characterization of ideal 0-1 matrices
• Graphical properties related to minimal imperfection
• The matroids with the max-flow min-cut property
• Combinatorial designs and related systems
• A characterization of perfect graphs
• The Forbidden Minors of Binary Clutters
• Perfect zero–one matrices
• Bottleneck extrema

This page was built for publication: A note on clutter partitions