论文信息 - A new algorithm for finding all minimal cuts in modified networks - 字舞流文

A new algorithm for finding all minimal cuts in modified networks

Wei-Chang Yeh | Yc Chen | Hc Ho | Ym Yeh

[1] Sheng-De Wang,et al. Reliability evaluation for distributed computing networks with imperfect nodes , 1997 .

[2] Sieteng Soh,et al. A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities , 1991 .

[3] Yi-Kuei Lin,et al. Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs , 2002, Reliab. Eng. Syst. Saf..

[4] Wei-Chang Yen. A Simple Heuristic Algorithm for Generating All Minimal Paths , 2007, IEEE Transactions on Reliability.

[5] Michael O. Ball,et al. Computational Complexity of Network Reliability Analysis: An Overview , 1986, IEEE Transactions on Reliability.

[6] Amjed M. Al-Ghanim,et al. A heuristic technique for generating minimal path and cutsets of a general network , 1999 .

[7] Charles J. Colbourn,et al. The Combinatorics of Network Reliability , 1987 .

[8] Terje Aven,et al. Some considerations on reliability theory and its applications , 1988 .

[9] Wei-Chang Yeh. A simple algorithm to search for all MCs in networks , 2006, Eur. J. Oper. Res..

[10] Junzo Watada,et al. Reliability optimization of a series-parallel system with fuzzy random lifetimes , 2009 .

[11] Terje Aven,et al. Availability evaluation of oil/gas production and transportation systems , 1987 .

[12] Jiandong Li,et al. RELIABILITY ANALYSIS OF AN N-COMPONENT SERIES SYSTEM WITH M FAILURE MODES AND VACATION , 2008 .