The Fastest Path through a Network with Random Time-Dependent Travel Times
暂无分享,去创建一个
[1] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[2] Robert B Dial,et al. TRANSIT PATHFINDER ALGORITHM , 1967 .
[3] Katta G. Murty,et al. Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..
[4] Randolph W Hall. TRAVELER ROUTE CHOICE UNDER SIX INFORMATION SCENARIOS : TRANSIT LEVEL OF SERVICE IMPLICATIONS , 1982 .
[5] R. Bellman. Dynamic programming. , 1957, Science.
[6] F P Clerq. A PUBLIC TRANSPORT ASSIGNMENT METHOD , 1972 .
[7] S E Keak. TRANSEPT: A BUS MODEL , 1976 .
[8] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[9] R. E. Bellman,et al. Review: Eugene L. Lawler, Combinatorial optimization: networks and matroids , 1978 .
[10] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[11] A. Pierce. Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956-1974) , 1975, Networks.
[12] Ronald A. Howard,et al. Dynamic Programming , 1966 .
[13] Randolph W. Hall,et al. Traveler route choice: Travel time implications of improved information and adaptive decisions , 1983 .