Reliability evaluation of a multistate network under routing policy
暂无分享,去创建一个
[1] Kailash C. Kapur,et al. Reliability Bounds for Multistate Systems with Multistate Components , 1985, Oper. Res..
[2] Soondal Park,et al. A label-setting algorithm for finding a quickest path , 2004, Comput. Oper. Res..
[3] Wei-Chang Yeh,et al. A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability , 2008, Reliab. Eng. Syst. Saf..
[4] Y. H. Chin,et al. The quickest path problem , 1990, Comput. Oper. Res..
[5] C. Alexopoulos. A note on state-space decomposition methods for analyzing stochastic flow networks , 1995 .
[6] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.
[7] João C. N. Clímaco,et al. Internet packet routing: Application of a K , 2007, Eur. J. Oper. Res..
[8] Gen-Huey Chen,et al. Algorithms for the constrained quickest path problem and the enumeration of quickest paths , 1994, Comput. Oper. Res..
[9] Yi-Kuei Lin,et al. On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint , 2007, Eur. J. Oper. Res..
[10] D. T. Lee,et al. The All-Pairs Quickest Path Problem , 1993, Inf. Process. Lett..
[11] Gen-Huey Chen,et al. On the Quickest Path Problem , 1991, ICCI.
[12] Yen-Liang Chen,et al. An algorithm for finding the k quickest paths in a network , 1993, Comput. Oper. Res..
[13] Chin-Chia Jane,et al. On reliability evaluation of a capacitated-flow network in terms of minimal pathsets , 1995, Networks.
[14] Ernesto de Queirós Vieira Martins,et al. An algorithm for the quickest path problem , 1997, Oper. Res. Lett..
[15] John Yuan,et al. Reliability evaluation of a limited-flow network in terms of minimal cutsets , 1993 .
[16] Xue Janan,et al. On Multistate System Analysis , 1985, IEEE Transactions on Reliability.
[17] Thomas L. Magnanti,et al. Deterministic network optimization: A bibliography , 1977, Networks.
[18] Terje Aven,et al. Reliability Evaluation of Multistate Systems with Multistate Components , 1985, IEEE Transactions on Reliability.
[19] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[20] João C. N. Clímaco,et al. An algorithm for ranking quickest simple paths , 2005, Comput. Oper. Res..
[21] Wei-Chang Yeh. An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths , 2007, Reliab. Eng. Syst. Saf..
[22] Yi-Kuei Lin,et al. Reliability of a stochastic-flow network with unreliable branches & nodes, under budget constraints , 2004, IEEE Trans. Reliab..
[23] Ravindra K. Ahuja,et al. Minimum cost-reliability ratio path problem , 1988, Comput. Oper. Res..
[24] Yi-Kuei Lin,et al. Reliability Evaluation for an Information Network With Node Failure Under Cost Constraint , 2007, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.
[25] Yi-Kuei Lin,et al. Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network , 2003, Comput. Oper. Res..
[26] John Erik Hershey,et al. Fast algorithm for computing the reliability of a communication network , 1991 .
[27] Yen-Liang Chen,et al. Minimum time paths in a network with mixed time constraints , 1998, Comput. Oper. Res..
[28] Y. L. Chen,et al. Finding the k Quickset Simple Paths in a Network , 1994, Inf. Process. Lett..
[29] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .
[30] Gen-Huey Chen,et al. On the Quickest Path Problem , 1990, Inf. Process. Lett..
[31] Gen-Huey Chen,et al. Distributed algorithms for the quickest path problem , 1992, Parallel Comput..