A dual simplex algorithm for finding all shortest paths
暂无分享,去创建一个
[1] E. Denardo,et al. Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..
[2] René Dionne. Etude Et Extension D’Un Algorithme De Murghland , 1978 .
[3] Giorgio Gallo,et al. Reoptimization procedures in shortest path problem , 1980 .
[4] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[5] Norman Zadeh,et al. On building minimum cost communication networks , 1973, Networks.
[6] Larry J. LeBlanc,et al. AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .
[7] U. Pape,et al. Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..
[8] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[9] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.