MICROCOMPUTER-BASED ALGORITHMS FOR LARGE-SCALE SHORTEST-PATH PROBLEMS

被引：2
|
作者：
KLINGMAN, DD [1 ]
SCHNEIDER, RF [1 ]
机构：
[1] UNIV ARIZONA,COLL BUSINESS & PUBL ADM,DEPT MANAGEMENT INFORMAT,TUCSON,AZ 85721
来源：
DISCRETE APPLIED MATHEMATICS | 1986年 / 13卷 / 2-3期
关键词：
D O I：
10.1016/0166-218X(86)90081-8
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：183 / 206
页数：24
相关论文
共 50 条
  • [21] GREEDY PARTITIONED ALGORITHMS FOR THE SHORTEST-PATH PROBLEM
    ADAMSON, P
    TICK, E
    [J]. INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1992, 20 (04) : 271 - 298
  • [22] SHORTEST-PATH AND CLOSURE ALGORITHMS FOR BANDED MATRICES
    ALLISON, L
    DIX, TI
    YEE, CN
    [J]. INFORMATION PROCESSING LETTERS, 1991, 40 (06) : 317 - 322
  • [23] APPLICATIONS OF SHORTEST-PATH ALGORITHMS TO MATRIX SCALINGS
    VONGOLITSCHEK, M
    SCHNEIDER, H
    [J]. NUMERISCHE MATHEMATIK, 1984, 44 (01) : 111 - 126
  • [24] ASYMPTOTIC OPTIMALITY OF SHORTEST-PATH ROUTING ALGORITHMS
    GAFNI, EM
    BERTSEKAS, DP
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (01) : 83 - 90
  • [25] Shortest-Path Algorithms and Dynamic Cost Changes
    Baselau, Sven
    Hahne, Felix
    Ambrosi, Klaus
    [J]. OPERATIONS RESEARCH PROCEEDINGS 2007, 2008, : 111 - 116
  • [26] LEVEL GRAPHS AND APPROXIMATE SHORTEST-PATH ALGORITHMS
    SHAPIRO, J
    WAXMAN, J
    NIR, D
    [J]. NETWORKS, 1992, 22 (07) : 691 - 717
  • [27] DISTRIBUTED COMPUTATION ON GRAPHS - SHORTEST-PATH ALGORITHMS
    CHANDY, KM
    MISRA, J
    [J]. COMMUNICATIONS OF THE ACM, 1982, 25 (11) : 833 - 837
  • [28] ON THE EQUIVALENCE BETWEEN SOME SHORTEST-PATH ALGORITHMS
    SHERALI, HD
    [J]. OPERATIONS RESEARCH LETTERS, 1991, 10 (02) : 61 - 65
  • [29] Speeding up dynamic shortest-path algorithms
    Buriol, Luciana S.
    Resende, Mauricio G. C.
    Thorup, Mikkel
    [J]. INFORMS JOURNAL ON COMPUTING, 2008, 20 (02) : 191 - 204
  • [30] Faster shortest-path algorithms for planar graphs
    Henzinger, MR
    Klein, P
    Rao, S
    Subramanian, S
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 55 (01) : 3 - 23
12345