Matroids and a Reliability Analysis Problem

DOI10.1287/MOOR.4.2.132MaRDI QIDQ4194709zbMATH OpenOpenAlexFDO

Authors Michael O. Ball, G. L. Nemhauser

Publication date 1979

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.4.2.132

zbMATH Keywords

Application of Mathematical ProgrammingCoherent Binary SystemIndependence SystemMatroidsMulticomponent SystemReliability

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Reliability, availability, maintenance, inspection in operations research (90B25) Applications of mathematical programming (90C90)

Cited in

(10)

• Chip firing and all-terminal network reliability bounds
• Matroid Steiner problems, the Tutte polynomial and network reliability
• Generalized activities and K-terminal reliability. II
• Convexity and logical analysis of data
• Evaluating Best-Case and Worst-Case Coefficients of Variation when Bounds Are Available
• Bounds on the Reliability Polynomial for Shellable Independence Systems
• Tree-shellability of Boolean functions
• Network reliability: Heading out on the highway
• Compression with wildcards: Abstract simplicial complexes
• The DNF exception problem

This page was built for publication: Matroids and a Reliability Analysis Problem

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