Matroids and a Reliability Analysis Problem
From MaRDI portal
Publication:4194709
DOI10.1287/moor.4.2.132zbMath0407.90034OpenAlexW2119950759MaRDI QIDQ4194709
Michael O. Ball, Nemhauser, George I.
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
ReliabilityMatroidsApplication of Mathematical ProgrammingIndependence SystemCoherent Binary SystemMulticomponent System
Applications of mathematical programming (90C90) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
The DNF exception problem, Matroid Steiner problems, the Tutte polynomial and network reliability, Generalized activities and \(K\)-terminal reliability. II, Network reliability: Heading out on the highway, Compression with wildcards: Abstract simplicial complexes, Tree-shellability of Boolean functions, Chip firing and all-terminal network reliability bounds, 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
