Reliability covering problems

DOI10.1002/NET.3230210306MaRDI QIDQ3971580zbMATH OpenOpenAlexFDO

Authors Michael O. Ball, J. Scott Provan, Douglas R. Shier

Publication date 25 June 1992

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230210306

zbMATH Keywords

polynomially solvable casesreliability coveringconsecutive \(k\)-out- of-\(n\) systemsreliability computations

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Abstract computational complexity for mathematical programming problems (90C60) Stochastic network models in operations research (90B15)

Recommendations

• Reliability covering problems for hypergraphs
• scientific article; zbMATH DE number 4023016
• Reliability of systems subjected to imperfect fault coverage
• scientific article; zbMATH DE number 1984140
• scientific article; zbMATH DE number 4069976
• A Problem in Reliability Optimization
• scientific article; zbMATH DE number 1163516
• Evaluation of reliability bounds by set covering models.

Cited in

(14)

• The distributed program reliability analysis on ring-type topologies
• Network reliability: Heading out on the highway
• Network reliability and the probabilistic estimation of damage from fire spread
• The computational complexity of the reliability problem on distributed systems
• A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
• A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges
• The arborescence-realization problem
• scientific article; zbMATH DE number 4023016 (Why is no real title available?)
• Reliability, covering and balanced matrices
• Network location of a reliable center using the most reliable route policy
• Reliability covering problems for hypergraphs
• A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
• Computing the \(K\)-terminal reliability of directed path graphs
• An edge-turbulence algorithm for the 2-MRS problem on trees with unreliable edges

This page was built for publication: Reliability covering problems

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