A note on clutter partitions

DOI10.1016/0167-6377(94)90047-7MaRDI QIDQ1332941zbMATH OpenOpenAlexFDO

Authors 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

blocking polyhedracovered and partitionable cluttersdiscrete optimizationminimally nonideal matricesperfect graphs

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) Matrices of integers (15B36) Boolean programming (90C09)

Recommendations

• scientific article; zbMATH DE number 3073160
• An approach to cluster separability in a partition
• A note on the complexity of a partition algorithm
• A bound on partitioning clusters
• On partitions
• A note on graphical partitions
• On practical partitions
• A Note on Solid Partitions
• scientific article; zbMATH DE number 3865287
• On 2-partitionable clutters and the MFMC property

Cites work

• A characterization of perfect graphs
• Bottleneck extrema
• Combinatorial designs and related systems
• Graphical properties related to minimal imperfection
• scientific article; zbMATH DE number 16723 (Why is no real title available?)
• scientific article; zbMATH DE number 16724 (Why is no real title available?)
• Lehman's forbidden minor characterization of ideal 0-1 matrices
• Perfect zero–one matrices
• The Forbidden Minors of Binary Clutters
• The matroids with the max-flow min-cut property

Cited in

(2)

• Imperfect and nonideal clutters: A common approach
• scientific article; zbMATH DE number 2159270 (Why is no real title available?)

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

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