Bounds on the Reliability of Networks
- 1 January 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 35 (3) , 260-268
- https://doi.org/10.1109/TR.1986.4335429
Abstract
This paper presents criteria for acceptable schemes to approximate system reliability and Investigates such schemes for a special clas of network reliability problems. In this framework, we are able to use powerful combinatorial theory to obtain strong bounds for network reliability which can be computed by efficient algorithms. We demonstrate these bounds on a small example, and give some computational experience.Keywords
This publication has 19 references indexed in Scilit:
- Polyhedral Combinatorics and Network ReliabilityMathematics of Operations Research, 1986
- Bounds on the Reliability Polynomial for Shellable Independence SystemsSIAM Journal on Algebraic Discrete Methods, 1982
- The Numbers of Faces of Polytope Pairs and Unbounded PolyhedraEuropean Journal of Combinatorics, 1981
- Recursive Disjoint Products, Inclusion-Exclusion, and Min-Cut ApproximationsIEEE Transactions on Reliability, 1980
- Complexity of network reliability computationsNetworks, 1980
- A Method for Calculation of Network ReliabilityIEEE Transactions on Reliability, 1976
- Approximations to System Reliability Using a Modular DecompositionTechnometrics, 1970
- A Computer Program for Approximating System ReliabilityIEEE Transactions on Reliability, 1970
- An Algorithm to Determine the Reliability of a Complex SystemIEEE Transactions on Reliability, 1969
- Coherent Structures of Non-Identical ComponentsTechnometrics, 1963