COMPUTATIONAL STUDY OF AN IMPROVED SHORTEST-PATH ALGORITHM

被引:30
|
作者
GLOVER, F [1 ]
GLOVER, R [1 ]
KLINGMAN, D [1 ]
机构
[1] UNIV TEXAS,DEPT GEN BUSINESS,AUSTIN,TX 78712
关键词
D O I
10.1002/net.3230140103
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:25 / 36
页数:12
相关论文
共 50 条
  • [31] Implementation and evaluation of AntNet, a distributed shortest-path algorithm
    Strobbe, M
    Verstraete, V
    Van Breusegem, E
    Coppens, J
    Pickavet, M
    Demeester, P
    Telecommunications 2005, Proceedings, 2005, : 320 - 325
  • [32] A SINGLE SOURCE SHORTEST-PATH ALGORITHM FOR GRAPHS WITH SEPARATORS
    MEHLHORN, K
    SCHMIDT, BH
    LECTURE NOTES IN COMPUTER SCIENCE, 1983, 158 : 302 - 309
  • [33] Shortest-path routing based on ant-algorithm
    Min, LY
    Yang, JY
    DCABES 2004, Proceedings, Vols, 1 and 2, 2004, : 228 - 230
  • [34] Adaptive shortest-path on-line routing algorithm
    Lab de Recherche en Informatique URA, CNRS, Orsay, France
    Conf Rec IEEE Global Telecommun Conf, (1664-1669):
  • [35] A NEW RESPONSIVE DISTRIBUTED SHORTEST-PATH ROUTING ALGORITHM
    RAJAGOPALAN, B
    FAIMAN, M
    COMMUNICATIONS ARCHITECTURES & PROTOCOLS: SIGCOMM 89 SYMPOSIUM, 1989, 19 : 237 - 246
  • [36] Routing Military Aircraft With A Constrained Shortest-Path Algorithm
    Royset, Johannes O.
    Carlyle, W. Matthew
    Wood, R. Kevin
    MILITARY OPERATIONS RESEARCH, 2009, 14 (03) : 31 - 52
  • [37] An adaptive shortest-path on-line routing algorithm
    Chich, T
    GLOBECOM 98: IEEE GLOBECOM 1998 - CONFERENCE RECORD, VOLS 1-6: THE BRIDGE TO GLOBAL INTEGRATION, 1998, : 1664 - 1669
  • [38] A LOCAL ALGORITHM FOR THE SHORTEST-PATH PROBLEM WITH A SINGLE SOURCE
    ANISIMOV, AV
    CYBERNETICS, 1986, 22 (03): : 327 - 332
  • [39] A THEOREM ON THE EXPECTED COMPLEXITY OF DIJKSTRA SHORTEST-PATH ALGORITHM
    NOSHITA, K
    JOURNAL OF ALGORITHMS, 1985, 6 (03) : 400 - 408
  • [40] Knapsack: Connectedness, Path, and Shortest-Path
    Dey, Palash
    Kolay, Sudeshna
    Singh, Sipra
    LATIN 2024: THEORETICAL INFORMATICS, PT II, 2024, 14579 : 162 - 176