Transmission reliability of k minimal paths within time threshold

[1]  Thomas L. Magnanti,et al.  Deterministic network optimization: A bibliography , 1977, Networks.

[2]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[3]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[4]  Terje Aven,et al.  Reliability Evaluation of Multistate Systems with Multistate Components , 1985, IEEE Transactions on Reliability.

[5]  Xue Janan,et al.  On Multistate System Analysis , 1985, IEEE Transactions on Reliability.

[6]  Kailash C. Kapur,et al.  Reliability Bounds for Multistate Systems with Multistate Components , 1985, Oper. Res..

[7]  Charles J. Colbourn,et al.  Lower bounds on two-terminal network reliability , 1988, Discret. Appl. Math..

[8]  Ravindra K. Ahuja,et al.  Minimum cost-reliability ratio path problem , 1988, Comput. Oper. Res..

[9]  Y. H. Chin,et al.  The quickest path problem , 1990, Comput. Oper. Res..

[10]  John Erik Hershey,et al.  Fast algorithm for computing the reliability of a communication network , 1991 .

[11]  Gen-Huey Chen,et al.  Distributed algorithms for the quickest path problem , 1992, Parallel Comput..

[12]  John Yuan,et al.  Reliability evaluation of a limited-flow network in terms of minimal cutsets , 1993 .

[13]  D. T. Lee,et al.  The All-Pairs Quickest Path Problem , 1993, Inf. Process. Lett..

[14]  Yen-Liang Chen,et al.  An algorithm for finding the k quickest paths in a network , 1993, Comput. Oper. Res..

[15]  Y. L. Chen,et al.  Finding the k Quickset Simple Paths in a Network , 1994, Inf. Process. Lett..

[16]  Gen-Huey Chen,et al.  Algorithms for the constrained quickest path problem and the enumeration of quickest paths , 1994, Comput. Oper. Res..

[17]  Chin-Chia Jane,et al.  On reliability evaluation of a capacitated-flow network in terms of minimal pathsets , 1995, Networks.

[18]  C. Alexopoulos.  A note on state-space decomposition methods for analyzing stochastic flow networks , 1995 .

[19]  Yuanlong Shen,et al.  A new simple algorithm for enumerating all minimal paths and cuts of a graph , 1995 .

[20]  Ernesto de Queirós Vieira Martins,et al.  An algorithm for the quickest path problem , 1997, Oper. Res. Lett..

[21]  Yen-Liang Chen,et al.  Minimum time paths in a network with mixed time constraints , 1998, Comput. Oper. Res..

[22]  K. Kobayashi,et al.  A new algorithm in enumerating all minimal paths in a sparse network , 1999 .

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

[24]  Wei-Chang Yeh.  Search for minimal paths in modified networks , 2002, Reliab. Eng. Syst. Saf..

[25]  Yi-Kuei Lin,et al.  Flow reliability of a probabilistic capacitated-flow network in multiple node pairs case , 2003, Comput. Ind. Eng..

[26]  Yi-Kuei Lin,et al.  Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network , 2003, Comput. Oper. Res..

[27]  Soondal Park,et al.  A label-setting algorithm for finding a quickest path , 2004, Comput. Oper. Res..

[28]  João C. N. Clímaco,et al.  An algorithm for ranking quickest simple paths , 2005, Comput. Oper. Res..

[29]  João C. N. Clímaco,et al.  Internet packet routing: Application of a K , 2007, Eur. J. Oper. Res..

[30]  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.

[31]  Yi-Kuei Lin,et al.  On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint , 2007, Eur. J. Oper. Res..

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