Algorithms to determine the threshold reliability of flow networks

IIE Transactions (Institute of Industrial Engineers)

Volumn 36, Issue 5, 2004, Pages 469-479

  Jane, Chin Chia ^a   Laih, Yih Wenn ^a  

^a LING TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBABILITY; PROBLEM SOLVING;

FLOW NETWORKS; THRESHOLD RELIABILITY;

RELIABILITY THEORY;

EID: 1842739004     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170490426170     Document Type: Article

References (23)

1. Ahuja, R.K., Kodialam, M., Mishra, A.K. and Orlin, J.B. (1997) Computational investigations of maximum flow algorithms. European Journal of Operational Research, 97, 509-542.
2. Aggarwal, K.K. (1988) A fast algorithm for the performance index of a telecommunication network. IEEE Transactions on Communications, 23, 563-566.
3. Aggarwal, K.K., Chopra, Y.C. and Bajwa, J.S. (1982) Modification of minimal cuts for reliability evaluation of communication systems. Microelectronics and Reliability, 22, 337-340.
4. Ang, A.H.S. and Tang, W.H. (1990) Probability Concepts in Engineering Planning and Design, Vol. II-Decision, Risk, and Reliability. Wiley, New York, NY.
5. Ball, M.O. (1979) Computing network reliability. Operations Research, 27, 823-838.
6. Ball, M.O. (1986) Computational complexity of network reliability analysis: an overview. IEEE Transactions on Reliability, 35, 230-239.
7. Ball, M.O., Hagstrom, J. and Provan, J.S. (1995) Threshold reliability of networks with small failure sets. Networks, 25, 101-115.
8. Colbourn, C.J. (1987) The Combinatorics of Network Reliability, Oxford University Press, New York, NY.
9. Dinic, E.A. (1970) Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Mathematics Doklady, 11, 1277-1280.
10. Doulliez, P. and Jamoulle, E. (1972) Transportation networks with random arc capacities. Revue Francaise d'Automatique, Informatique et Recherche Operationnelle, 2, 45-59.
11. Ford, L.R. and Fulkerson, D.R. (1962) Flows in Networks, Princeton University Press, Princeton, NJ.
12. Fratta, J. and Montanari, U.G. (1973) A Boolean algebra method for computing the terminal reliability in a communication network, IEEE Transactions on Circuit Theory, 20, 203-211.
13. Jane, C.-C. and Yuan, J. (2001) A sum of disjoint products algorithm for reliability evaluation of flow networks. European Journal of Operational Research, 131(3), 664-675.
14. Klingman, D., Napier, A. and Stutz, J. (1974) NETGEN: a program for generating large scale capacitated assignment, transportation and minimum cost flow network problems. Management Science, 20(5), 814-821.
15. Lee, S.H. (1980) Reliability evaluation of a flow network. IEEE Transactions on Reliability, 29(1), 24-26.
16. Locks, M.O. (1982) Recursive disjoint products: a review of three algorithms. IEEE Transactions on Reliability, 31(1), 33-35.
17. Misra, K.B. and Prasad, P. (1982) Comments on reliability evaluation of flow networks. IEEE Transactions on Reliability, 31(1), 174-176.
18. Papadimitriou, C.H. and Steiglitz, K. (1982) Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ.
19. Rai, S. and Soh, S. (1991) A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities. IEEE Transactions on Reliability, 40(4), 441-451.
20. Rueger, W.J. (1986) Reliability analysis of networks with capacity constraints and failure at branches and nodes. IEEE Transactions on Reliability, 35(5), 523-528.
21. Shier, D.R. (1991) Network Reliability and Algebraic Structures, Clarendon Press, Oxford, UK.
22. Tarjan, R.E. (1983) Data Structures and Network Algorithms, Society of Industrial and Applied Mathematics, Philadelphia, PA.
23. Van Slyke, R. and Frank, H. (1972) Network reliability analysis: part I. Networks, 1, 279-290.