Dual algorithms for the shortest path tree problem
暂无分享,去创建一个
[1] G. Gallo,et al. SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .
[2] Dimitri P. Bertsekas,et al. An Auction Algorithm for Shortest Paths , 1991, SIAM J. Optim..
[3] Dimitri P. Bertsekas,et al. Polynomial auction algorithms for shortest paths , 1995, Comput. Optim. Appl..
[4] Dimitri P. Bertsekas,et al. Linear network optimization - algorithms and codes , 1991 .
[5] Sang Nguyen,et al. A dual simplex algorithm for finding all shortest paths , 1981, Networks.
[6] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[7] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .
[8] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[9] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[10] M. S. Bazaraa,et al. A Dual Shortest Path Algorithm , 1974 .
[11] Michel Minoux,et al. Graphs and Algorithms , 1984 .