1 |
Bellman R. and Kalaba R. (1968) On Kth Best Policies. J. SIAM 8, pp.582-588
|
2 |
Pollack M. (1961) The Kth Best Route Through A Network, Operations Research, Vol.9, pp.578-580
DOI
ScienceOn
|
3 |
Shier R. D. (1979) On Algorithms from Finding the k Shortest Paths in a Network, Networks, Vol.9, pp.195-214
DOI
ScienceOn
|
4 |
Moore E. F. (1957) The Shortest Path through A Maze. Proc. Int. Conf. on the Theory of Switching. Harvard Univ., Cambridge, MA
|
5 |
Potts R.B. and Oliver R.M.(1972) Flows in Transportation Networks. Academic Press
|
6 |
Yen J.Y. (1971) Finding the K shortest Loopless Paths in a Network, Management Science, Vol.17, pp.711-715
|
7 |
Lee M. (2004) Transportation Network Models and Algorithms Considering Directional Delay and Prohibition for Intersection Movement, Ph.D. Thesis, University of Wisconsin-Madison
|
8 |
Dijkstra E. W. (1959) A Note of Two Problems in Connected with Graphs. Numerical Mathematics. I, pp.269-271
|
9 |
Yang H.H. and Chen Y.L. (2003) Finding K Shortest Looping Paths in A Traffic-Light Network, Computer & Operations Research
|
10 |
Kirby R. F. and Potts R. B. (1969) The Minimum Route Problem for Networks with Turn Penalties and Prohibitions. Transportation Research 3, pp.397-408
|
11 |
임용택(2004) 일반가로망에서 교통정보제공을 위한 n-path 알고리듬의 개발, 대한교통학회지, 제22권 제4호, 대한교통학회, pp.135-145
과학기술학회마을
|
12 |
Martins E.Q.V. (1984) An Algorithm for Ranking Paths that May Contain Cycles, European Journal of Operational Research, Vol.18, pp.123-130
DOI
ScienceOn
|
13 |
Azevedo J. A., Costa M. E. O. S., Madeira J.J.E.R.S., and Martins E.Q.V. (1993) An Algorithm from the Ranking of Shortest Paths, European Journal of Operational Research, Vol.69, pp.97-106
DOI
ScienceOn
|