Disjoint Products and Efficient Computation of Reliability

DOI10.1287/OPRE.36.5.703zbMath0665.90034OpenAlexW2034315530MaRDI QIDQ3818100

Michael O. Ball, J. Scott Provan

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1287/opre.36.5.703

zbMATH Keywords

upper and lower boundsmatroidsNP-hardshellabilityreliability analysis of complex systemsprobability of the union of a set of eventsthreshold systems

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (14)

Matroid Steiner problems, the Tutte polynomial and network reliability ⋮ Interior and exterior functions of Boolean functions ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ Interior and exterior functions of positive Boolean functions. ⋮ Competitive evaluation of threshold functions in the priced information model ⋮ Heuristic least-cost computation of discrete classification functions with uncertain argument values ⋮ Approximate method to evaluate reliability of complex networks ⋮ Note on complexity of computing the domination of binary systems ⋮ The reliability importance of components and prime implicants in coherent and non-coherent systems including total-order interactions ⋮ Bayesian inference based on partial monitoring of components with applications to preventive system maintenance ⋮ OBDDs of a monotone function and of its prime implicants ⋮ Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case ⋮ Tree-shellability of Boolean functions ⋮ Heuristic testing procedures for general coherent systems

This page was built for publication: Disjoint Products and Efficient Computation of Reliability