Fast computation of bounds for two-terminal network reliability
From MaRDI portal
Publication:296891
DOI10.1016/J.EJOR.2014.04.035zbMATH Open1338.90148OpenAlexW2008750370MaRDI QIDQ296891FDOQ296891
Authors: Stefano Sebastio, Dazhi Wang, Kishor S. Trivedi, Xiaoyan 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
Recommendations
- Practical sequential bounds for approximating two-terminal reliability
- A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
- First-and second-order bounds on terminal reliability
- Series-Parallel Bounds for the Two-Terminal Reliability Problem
- A dynamic bounding algorithm for approximating multi-state two-terminal reliability
binary decision diagram (BDD)bounds computationlarge network reliabilityreliability graphreliability prediction
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Introduction to algorithms.
- Graph-Based Algorithms for Boolean Function Manipulation
- Finding the k Shortest Paths
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Title not available (Why is that?)
- A new implementation of Yen's ranking loopless paths algorithm
- Title not available (Why is that?)
- Finding the K Shortest Loopless Paths in a Network
- Simulation methods for reliability and availability of complex systems
- Edge-packings of graphs and network reliability
- A fully dynamic algorithm for distributed shortest paths.
- 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
- 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
- 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
- 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
- Experimental results on preprocessing of path/cut terms in sim of disjoint products technique
- 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
- A sum of disjoint products algorithm for reliability evaluation of flow networks
- A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
Cited In (9)
- Multiplicative improvements in network reliability bounds
- A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
- Fast simulation of highly reliable networks with varying random external load
- A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
- Lower bounds on two-terminal network reliability
- First-and second-order bounds on terminal reliability
- Practical sequential bounds for approximating two-terminal reliability
- Computing diameter constrained reliability of a network with junction points
- Evaluations of quantiles of system lifetime distributions
Uses Software
This page was built for publication: Fast computation of bounds for two-terminal network reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296891)
