1 |
Shier, D. R. (1979), On algorithms for finding the Kvshortest paths in a network, Networks, 9, 195-214
DOI
ScienceOn
|
2 |
Van der Zijpp, N. J. and Fiorenzo Catalano (2005), Path enumeration by finding the constrained K-shortest paths, Transportation Research Part B, 39, 545-563
DOI
ScienceOn
|
3 |
Yen, J. Y. (1971), Finding the K shortest loop less paths in a network, Management Science, 17, 712-716
DOI
ScienceOn
|
4 |
Lawler, E. L. (1976), Combinatorial Optimization : Networks and Matroids, Holt, Rinehart & Winston, New York
|
5 |
Shier, D. R. (1976), Iterative methods for determining the K shortest paths in a network, Networks, 6, 205-229
DOI
ScienceOn
|
6 |
Eppstein, D. (1994), Finding the K shortest paths, In : Proc. 35th IEEE Symp, Foundations of Computer Science (FOCS_94), 154-165
|
7 |
Brander, A. W. and Sinclair, M. C. (1995), A comparative study of k-shortest path algorithms, In : Proc. 11th UK Performance Engineering Workshop for Computer and Telecommunications Systems
|
8 |
Goldberg, A. and Harrelson, C. (2005), Computing the Shortest Path: A* Search Meets Graph Theory, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, 156-165
|
9 |
Hadjiconstantinou, E. and Christofides, N. (1999), An efficient implementation of an algorithm for finding k shortest simple paths, Networks, 34, 88-101
DOI
ScienceOn
|
10 |
Song, J. H. (2004), Introduction to Telematics, Hongneung Chulpansa, Seoul, Korea, 3-8
|
11 |
Pohl, I. (1971), Bi-directional Search, Machine Intelligence, 6, 127-140
|
12 |
Bellman, R. and Kabala, R. (1960), On kth best policies, Journal of SIAM, 8, 582-585
|
13 |
Hoffman, W. and Pavley, R. (1959), A method for the solution of the nth best path problem, Journal of the Association for Computing Machinery (ACM), 6, 506-514
DOI
|
14 |
Fox, B. L. (1978), Data structures and computer science techniques in operation research, Operations Research, 26, 686-717
DOI
ScienceOn
|
15 |
Schnabel, W. and Lohse, D. (1997), Grundlagen der Strassen- Verkehrstechnik under Verkehrsplanung, Baud 2, neue bearb, Aufl.-1997, Verlag fur Bauwesen Gmhh, Berlin
|
16 |
Katoh, N., Ibaraki, T., and Mine, H. (1982), An efficient algorithm for k shortest simple paths, Networks, 12, 411-427
DOI
ScienceOn
|
17 |
Eppstein, D. (1998), Finding the K shortest paths, SIAM Journal Computing, 28(2), 652-673
DOI
ScienceOn
|