A method to simplify network representation in transportation planning
暂无分享,去创建一个
[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[2] E. Balas. Solution of Large-Scale Transportation Problems Through Aggregation , 1965 .
[3] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[4] John David Murchland,et al. A fixed matrix method for all shortest distances in a directed graph and for the inverse problem , 1970 .
[5] T. C. Hu. A Decomposition Algorithm for Shortest Paths in a Network , 1968, Oper. Res..
[6] Ronald F. Kirby,et al. The minimum route problem for networks with turn penalties and prohibitions , 1969 .
[7] E F Graham. APPLICATION OF LARGE NETWORK TRAFFIC ASSIGNMENTS TO SMALL AREA ROUTE LOCATION STUDIES , 1966 .
[8] A. J. Goldman. Realizing the distance matrix of a graph , 1966 .
[9] G. Mills. A Decomposition Algorithm for the Shortest-Route Problem , 1966, Oper. Res..