1 Implementations and empirical comparison of K shortest loopless path algorithms
暂无分享,去创建一个
[1] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.
[2] Marta M. B. Pascoal,et al. A new implementation of Yen’s ranking loopless paths algorithm , 2003, 4OR.
[3] Aarni Perko,et al. Implementation of algorithms for K shortest loopless paths , 1986, Networks.
[4] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[5] Andrew V. Goldberg,et al. Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.
[6] Richard Pavley,et al. A Method for the Solution of the Nth Best Path Problem , 1959, JACM.
[7] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[8] Nicos Christofides,et al. An efficient implementation of an algorithm for finding K shortest simple paths , 1999, Networks.
[9] Toshihide Ibaraki,et al. An efficient algorithm for K shortest simple paths , 1982, Networks.
[10] Marta M. B. Pascoal,et al. Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..
[11] J. Y. Yen,et al. Finding the K Shortest Loopless Paths in a Network , 2007 .