Reliability covering problems
From MaRDI portal
Publication:3971580
DOI10.1002/net.3230210306zbMath0738.90035OpenAlexW2033350906MaRDI QIDQ3971580
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
polynomially solvable casesreliability coveringconsecutive \(k\)-out- of-\(n\) systemsreliability computations
Abstract computational complexity for mathematical programming problems (90C60) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (13)
The computational complexity of the reliability problem on distributed systems ⋮ Network reliability and the probabilistic estimation of damage from fire spread ⋮ Reliability, covering and balanced matrices ⋮ The arborescence-realization problem ⋮ A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES ⋮ Network reliability: Heading out on the highway ⋮ A linear time algorithm for computing a most reliable source on a tree network with faulty nodes ⋮ Reliability covering problems for hypergraphs ⋮ Network location of a reliable center using the most reliable route policy ⋮ 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 ⋮ An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges ⋮ Computing the \(K\)-terminal reliability of directed path graphs
Cites Work
This page was built for publication: Reliability covering problems
