论文信息 - An algorithm for the ranking of shortest paths - 字舞流文

An algorithm for the ranking of shortest paths

E. Martins | J. D. Azevedo | M. E. Costa | J. Madeira

[1] E. Martins. An algorithm for ranking paths that may contain cycles , 1984 .

[2] E. Martins,et al. A bicriterion shortest path algorithm , 1982 .

[3] Y. Aneja,et al. The constrained shortest path problem , 1978 .

[4] E. Lawler. Shortest Path and Network Flow Algorithms , 1979 .

[5] Jin Y. Yen. Shortest path network problems , 1975 .

[6] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[7] J. Y. Yen. Finding the K Shortest Loopless Paths in a Network , 1971 .

[8] Gabriel Y. Handler,et al. A dual algorithm for the constrained shortest path problem , 1980, Networks.

[9] Narsingh Deo,et al. Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.

[10] Maurice Snowdon,et al. Network Flow Programming , 1980 .

[11] Arun K. Pujari,et al. A note on the constrained shortest‐path problem , 1984 .

[12] E. Denardo,et al. Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[13] G. Gallo,et al. SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .

[14] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[15] Douglas R. Shier,et al. Iterative methods for determining the k shortest paths in a network , 1976, Networks.