Threshold reliability of networks with small failure sets

DOI10.1002/NET.3230250304MaRDI QIDQ4838201zbMATH OpenOpenAlexFDO

Authors Michael O. Ball, Jane N. Hagstrom, J. Scott Provan

Publication date 20 July 1995

Published in Networks (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1903/5388

zbMATH Keywords

project schedulingreliability analysisnetwork flow modeldirectional acyclic graphfailed arcstwo state arcs

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Maximum flows in probabilistic networks
• scientific article; zbMATH DE number 795224
• scientific article; zbMATH DE number 4097115
• Reliability Analysis of Networks with Capacity-Constraints and Failures at Branches & Nodes

Cites work

• On the structure of all minimum cuts in a network and applications

Cited in

(7)

• On redundant weighted voting systems with components having stochastic arrangement increasing lifetimes
• Two-path subsets: Efficient counting and applications to performability analysis
• On the reliability modeling of weighted \(k\)-out-of-\(n\) systems with randomly chosen components
• On the inapproximability of minimizing cascading failures under the deterministic threshold model
• Network reliability: Heading out on the highway
• ON WEIGHTED K-OUT-OF-N SYSTEMS WITH STATISTICALLY DEPENDENT COMPONENT LIFETIMES
• Network reliability with arc failures and repairs

This page was built for publication: Threshold reliability of networks with small failure sets

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