An algorithm to evaluate public transportation stops for minimizing passenger walking distance
暂无分享,去创建一个
[1] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .
[2] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[3] J. Rubin. A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling , 1973 .
[4] Nicos Christofides,et al. The Optimum Location of Multi-centres on a Graph , 1971 .
[5] Moshe Ben-Akiva,et al. DISAGGREGATE MULTIMODAL MODEL FOR WORK TRIPS IN THE NETHERLANDS , 1976 .
[6] Philip M. Spira,et al. A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n2 log2n) , 1973, SIAM J. Comput..
[7] E. Minieka. The m-Center Problem , 1970 .
[8] Yves Tabourier,et al. All shortest distances in a graph. An improvement to Dantzig's inductive algorithm , 1973, Discret. Math..
[9] James T. Yen,et al. Generalization of the Gibbsian relation for dilute systems , 1972 .
[10] Gabriel Y. Handler,et al. Minimax network location : theory and algorithms , 1974 .
[11] Joseph N Prashker. Development of a 'reliability of travel modes' variable for mode choice models , 1977 .
[12] Egon Balas,et al. On the Set-Covering Problem , 1972, Oper. Res..
[13] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[14] George B. Dantzig,et al. ALL SHORTEST ROUTES IN A GRAPH , 1966 .