Fast computation of bounds for two-terminal network reliability
DOI10.1016/j.ejor.2014.04.035zbMath1338.90148OpenAlexW2008750370MaRDI QIDQ296891
Dazhi Wang, Stefano Sebastio, Kishor S. Trivedi, Xiao-Yan Yin
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.035
binary decision diagram (BDD)bounds computationlarge network reliabilityreliability graphreliability prediction
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
- Simulation methods for reliability and availability of complex systems
- Edge-packings of graphs and network reliability
- A fully dynamic algorithm for distributed shortest paths.
- A new implementation of Yen's ranking loopless paths algorithm
- Practical sequential bounds for approximating two-terminal reliability
- A Monte Carlo Sampling Plan for Estimating Network Reliability
- Bounds on the reliability of binary coherent systems
- Reliability of directed networks using the factoring theorem
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- High-confidence estimation of small s -t reliabilities in directed acyclic networks
- Calculating bounds on reachability and connectedness in stochastic networks
- Algorithms for Generating Minimal Cutsets by Inversion
- Reliability Bounds for Multistate Systems with Multistate Components
- A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
- Graph-Based Algorithms for Boolean Function Manipulation
- Computational Complexity of Network Reliability Analysis: An Overview
- Bounding network-reliability using consecutive minimal cutsets
- Sequential Destruction Method for Monte Carlo Evaluation of System Reliability
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
- Recursive Disjoint Products: A Review of Three Algorithms
- Estimation of network reliability using graph evolution models
- Series-Parallel Bounds for the Two-Terminal Reliability Problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph
- A New Algorithm for Symbolic System Reliability Analysis
- Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
- Experimental results on preprocessing of path/cut terms in sim of disjoint products technique
- Finding the k Shortest Paths
- Smaller sums of disjoint products by subproduct inversion
- Network reliability and the factoring theorem
- THE TREE CUT AND MERGE ALGORITHM FOR ESTIMATION OF NETWORK RELIABILITY
- A survey of efficient reliability computation using disjoint products approach
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs
- Network Reliability Assessment through Empirical Models Using a Machine Learning Approach
- A Reliability Bound for Systems of Maintained, Interdependent Components
- Finding the K Shortest Loopless Paths in a Network
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- A sum of disjoint products algorithm for reliability evaluation of flow networks
This page was built for publication: Fast computation of bounds for two-terminal network reliability
