1 |
임강원 . 임용택(2003), 교통망 분석론, 서울대학교 출판부
|
2 |
Moore E. F.(1957) The Shortest Path through A Maze, Proc. Int. Conf. on the Theory of Switching, Harvard Univ., Cambridge, MA
|
3 |
Shier R. D. (1979) On Algorithms from Finding the K Shortest Paths in A Networks, Vol. 9, pp.195-214
|
4 |
Yen J.Y.(1971), 'Finding the K shortest loopless paths in a network, Management Science, Vol.17, pp.711-715
|
5 |
Eppstein D.(1998), 'Finding the k shortest paths, SIAM J. Computing, Vol. 28, No. 2, pp.652-673
DOI
ScienceOn
|
6 |
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
|
7 |
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
|
8 |
신성일(2004), 교통망에 적합한 K 비루프 경로탐색 알고리즘, 대한교통학회지, 제22권 제6호, 대한교통학회, pp.121-131
|
9 |
Dijkstra E. W.(1959), A note of two problems in connected with graphs, Numerical Mathematics. I, pp.269-271
|
10 |
Jimenez V. M. and Marzal A.(2003), A lazy version of Eppstein's k shortest pahts algorithm, WEA 2003, LNCS 2647, pp. 179-191
|