论文信息 - An algorithm for finding the k quickest paths in a network - 字舞流文

An algorithm for finding the k quickest paths in a network

Yen-Liang Chen | Yen-Liang Chen

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

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

[3] Bennett L. Fox,et al. Data Structures and Computer Science Techniques in Operations Research , 1978, Oper. Res..

[4] Douglas R. Shier,et al. On algorithms for finding the k shortest paths in a network , 1979, Networks.

[5] Moshe J. Augenstein,et al. Data Structures Using Pascal , 1981 .

[6] Toshihide Ibaraki,et al. An efficient algorithm for K shortest simple paths , 1982, Networks.

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

[8] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[9] Y. H. Chin,et al. The quickest path problem , 1990, Comput. Oper. Res..

[10] J. Ben Rosen,et al. Algorithms for the quickest path problem and the enumeration of quickest paths , 1991, Comput. Oper. Res..

[11] Gen-Huey Chen,et al. On the Quickest Path Problem , 1991, ICCI.