Reliability covering problems

DOI10.1002/NET.3230210306zbMATH Open0738.90035OpenAlexW2033350906MaRDI QIDQ3971580FDOQ3971580

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

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

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)