메뉴 건너뛰기
4OR
Volumn 1, Issue 2, 2003, Pages 121-133
A new implementation of Yen's ranking loopless paths algorithm
Author keywords

loopless path; network; path; paths ranking
Indexed keywords

EID: 84891657889     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-002-0010-2     Document Type: Article
Times cited : (244)
References (19)
  • 2
    • 0018516142 scopus 로고
    • A computational analysis of alternative algorithms and labelling techniques for finding shortest path trees
    • Dial R, Glover G, Karney D, Klingman D (1979) A computational analysis of alternative algorithms and labelling techniques for finding shortest path trees. Networks 9: 215-348.
    • (1979) Networks , vol.9 , pp. 215-348
    • Dial, R.1    Glover, G.2    Karney, D.3    Klingman, D.4
  • 3
    • 0001591557 scopus 로고
    • Anote on two problems in connection with graphs
    • Dijkstra E (1959)Anote on two problems in connection with graphs. Numerical Mathematics 1: 395-412.
    • (1959) Numerical Mathematics , vol.1 , pp. 395-412
    • Dijkstra, E.1
  • 4
    • 0000418612 scopus 로고
    • An appraisal of some shortest-path algorithms
    • Dreyfus SE (1969) An appraisal of some shortest-path algorithms. Operations Research 17: 395-412.
    • (1969) Operations Research , vol.17 , pp. 395-412
    • Dreyfus, S.E.1
  • 5
    • 0032108018 scopus 로고    scopus 로고
    • Finding the k shortest paths
    • Eppstein D (1998) Finding the k shortest paths. SIAM Journal on Computing 28: 652-673.
    • (1998) SIAM Journal on Computing , vol.28 , pp. 652-673
    • Eppstein, D.1
  • 6
    • 0033196406 scopus 로고    scopus 로고
    • An efficient implementation of an algorithm for finding k shortest simple paths
    • Hadjiconstantinou E, Christofides N (1999) An efficient implementation of an algorithm for finding k shortest simple paths. Networks 34(2): 88-101.
    • (1999) Networks , vol.34 , Issue.2 , pp. 88-101
    • Hadjiconstantinou, E.1    Christofides, N.2
  • 8
    • 2142678730 scopus 로고    scopus 로고
    • Computing the k shortest paths: A new algorithm and an experimental comparison
    • Jiménez VM, Varó AM (1999) Computing the k shortest paths: a new algorithm and an experimental comparison. Proc. 3rdWorkshop Algorithm Engineering (terra. act. uji. es/REA/papers/wae99. ps. gz).
    • (1999) Proc. 3rdWorkshop Algorithm Engineering
    • Jiménez, V.M.1    Varó, A.M.2
  • 9
    • 0020292250 scopus 로고
    • An efficient algorithm for k shortest simple paths
    • Katho N, Ibaraki T, Mine H (1982)An efficient algorithm for k shortest simple paths. Networks 12: 411-427.
    • (1982) Networks , vol.12 , pp. 411-427
    • Katho, N.1    Ibaraki, T.2    Mine, H.3
  • 10
    • 0000685484 scopus 로고
    • A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem
    • Lawler EL (1972) A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science 18: 401-405.
    • (1972) Management Science , vol.18 , pp. 401-405
    • Lawler, E.L.1
  • 11
  • 12
    • 0042639544 scopus 로고    scopus 로고
    • A new shortest paths ranking algorithm
    • Martins EQV, Santos JLE (2000) A new shortest paths ranking algorithm. Investigãçao Operacional 20(1): 47-62 (www. mat. uc. pt/-equm/cientifices/investigacao/Artigos/k. ps. gz).
    • (2000) Investigãçao Operacional , vol.20 , Issue.1 , pp. 47-62
    • Martins, E.Q.V.1    Santos, J.L.E.2
  • 15
    • 0041637610 scopus 로고    scopus 로고
    • A new improvement for a k shortest paths algorithm
    • Martins EQV, Pascoal MMB, Santos JLE (2001) A new improvement for a k shortest paths algorithm. Investigaçao Operacional 21: 47-60 (www. mat. uc. pt/-marta/Publicacoes/ms_improved. ps. gz).
    • (2001) Investigaçao Operacional , vol.21 , pp. 47-60
    • Martins, E.Q.V.1    Pascoal, M.M.B.2    Santos, J.L.E.3
  • 16
    • 0022726286 scopus 로고
    • Implementation of algorithms for k shortest loopless paths
    • Perko A (1986) Implementation of algorithms for k shortest loopless paths. Networks 16: 149-160.
    • (1986) Networks , vol.16 , pp. 149-160
    • Perko, A.1
  • 17
    • 0016975520 scopus 로고
    • Interactive methods for determining the k shortest paths in a network
    • Shier D (1976) Interactive methods for determining the k shortest paths in a network. Networks 6: 151-159.
    • (1976) Networks , vol.6 , pp. 151-159
    • Shier, D.1
  • 18
    • 0000663732 scopus 로고
    • Finding the k shortest loopless paths in a network
    • Yen JY (1971) Finding the k shortest loopless paths in a network. Management Science 17: 712-716.
    • (1971) Management Science , vol.17 , pp. 712-716
    • Yen, J.Y.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.