A sum of disjoint products algorithm for reliability evaluation of flow networks

DOI10.1016/S0377-2217(00)00109-0zbMath0994.90057OpenAlexW2021163084MaRDI QIDQ5935396

Chin-Chia Jane, John Yuan

Publication date: 10 October 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00109-0

zbMATH Keywords

combinatorial analysis

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Production models (90B30) Deterministic network models in operations research (90B10)

Related Items (7)

Fast computation of bounds for two-terminal network reliability ⋮ Practical sequential bounds for approximating two-terminal reliability ⋮ Algorithms for the quickest time distribution of dynamic stochastic-flow networks ⋮ Models and methods for solving the problem of network vulnerability ⋮ Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks ⋮ Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks ⋮ A dynamic bounding algorithm for approximating multi-state two-terminal reliability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing Network Reliability in Time Polynomial in the Number of Cuts
• A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities
• Reliability Analysis of Networks with Capacity-Constraints and Failures at Branches & Nodes
• Recursive Disjoint Products: A Review of Three Algorithms
• Capacity Consideration in Reliability Analysis of Communication Systems
• Comment on "Reliability Evaluation of a Flow Network
• A Simple Method for Reliability Evaluation of a Communication System
• Reliability Evaluation of a Flow Network

This page was built for publication: A sum of disjoint products algorithm for reliability evaluation of flow networks