Practical sequential bounds for approximating two-terminal reliability

DOI10.1016/j.ejor.2008.02.022zbMath1159.90019OpenAlexW2046118731MaRDI QIDQ2378344

Yih-Wenn Laih, Wu-Hsien Shen, Chin-Chia Jane

Publication date: 8 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.02.022

zbMATH Keywords

decompositioncomputational experimentstwo-terminal reliabilitysequential bounds

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items

Fast computation of bounds for two-terminal network reliability ⋮ A practical bounding algorithm for computing two-terminal reliability based on decomposition technique ⋮ A dynamic bounding algorithm for approximating multi-state two-terminal reliability

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modified algorithm for computing the upper-bound reliabilty of computer networks
• A new short proof for the Kruskal-Katona theorem
• Edge-packings of graphs and network reliability
• Lower bounds on two-terminal network reliability
• Inclusion-exclusion and network reliability
• A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness
• Computational Complexity of Network Reliability Analysis: An Overview
• A Minimizing Algorithm for Sum of Disjoint Products
• Series-Parallel Bounds for the Two-Terminal Reliability Problem
• Roots of the Reliability Polynomials
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Monte Carlo and Markov Chain techniques for network reliability and sampling
• Reliable circuits using less reliable relays
• A sum of disjoint products algorithm for reliability evaluation of flow networks