[1] 罗鹏程, 金 光, 周经伦, 等. 通信网可靠性研究综述[J]. 小型微型计算机系统, 2000, 21(10): 1073-1077. [2] 李 森, 王 洁, 席博闻, 等. 结合网络可靠度不变缩减的蒙特卡洛仿真[J]. 计算机工程, 2011, 37(8): 61-63. [3] Ramirez J E. Innovative Approaches in Multistate Network Reliability Modeling and Computation[D]. New Brunswick, USA: The State University of New Jersey, 2004. [4] Jane C C, Laih Y W. A Dynamic Bounding Algorithm for Approximating Multi-state Two-terminal Reliability[J]. European Journal of Operational Research, 2010, 205(3): 625-637. [5] Liu Wu, Liu Yi, Gu Xueqin. Monte-carlo Simulation for the Reliability Analysis of Multi-status Network System Based on Breadth First Search[C]//Proc. of the 2nd International Conference on Information and Computing Science. [S. 1.]: IEEE Press, 2009: 280-283. [6] 王 芳, 侯朝祯. 一个估计随机流网络可靠性的新方法[J]. 小型微型计算机系统, 2005, 26(5): 783-787. [7] 刘玲艳, 吴晓平, 田树新. 基于粗糙集和Petri网的随机流网络可靠性评价方法[J]. 控制与决策, 2010, 25(8): 1273-1276. [8] Zuo M J, Tian Z G, Huang H Z. An Efficient Method for Reliability Evaluation of Multistate Networks Given all Minimal Path Vectors[J]. IEEE Transactions on Reliability, 2007, 39(8): 811-877. [9] Yan Zou, Qian Meng. Improving Efficiency of Solving d-MC Problem in Stochastic-flow Network[J]. Reliability Engineering and System Safety, 2007, 92(1): 30-39. [10] Yeh W C. A Greedy Branch-and-bound Inclusion-exclusion Algorithm for Calculating the Exact Multi-state Network Reliability[J]. IEEE Transactions on Reliability, 2008, 57(1): 88-93. [11] Yeh W C. A Fast Algorithm for Searching All Multi-state Minimal Cuts[J]. IEEE Transactions on Reliability, 2009, 57(4): 581-588. [12] 孙艳蕊, 张祥德. 利用极小割计算随机流网络可靠度的一种算法[J]. 系统工程学报, 2010, 25(2): 284-288. [13] Patra S, Misra R B. Reliability Evaluation of Flow Nlements[J]. Micro-electron Reliability, 1993, 33(14): 2161-2164. [14] Doulliez P, Jamoulle E. Tansportation Networks with Random Arc Capacities[C]//Proc. of RAIRO’72. [S. 1.]: IEEE Press, 1972: 45- 60. [15] Alexopoulos C. A Note on State-space Decomposition Methods for Analyzing Stochastic Flow Networks[J]. IEEE Transactions on Reliability, 1995, 44(2): 354-357. [16] 张宪超, 陈国良, 万颖瑜. 网络最大流问题研究进展[J]. 计算机研究与发展, 2003, 40(9): 1281-1292.
|