Fast computation of bounds for two-terminal network reliability
- 1 November 2014
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 238 (3), 810-823
- https://doi.org/10.1016/j.ejor.2014.04.035
Abstract
No abstract availableThis publication has 63 references indexed in Scilit:
- Monte Carlo estimation of diameter-constrained network reliability conditioned by pathsets and cutsetsComputer Communications, 2013
- Static Network Reliability Estimation via Generalized SplittingINFORMS Journal on Computing, 2013
- A Monte Carlo sampling plan for estimating diameter-dependent network parametersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- The recursive variance-reduction simulation algorithm for network reliability evaluationIEEE Transactions on Reliability, 2003
- Series-Parallel Bounds for the Two-Terminal Reliability ProblemINFORMS Journal on Computing, 1989
- Bounds on the reliability of binary coherent systemsIEEE Transactions on Reliability, 1989
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Computational Complexity of Network Reliability Analysis: An OverviewIEEE Transactions on Reliability, 1986
- Calculating bounds on reachability and connectedness in stochastic networksNetworks, 1983
- Enumeration of All Minimal Cut-Sets for a Node Pair in a GraphIEEE Transactions on Reliability, 1979