An O(nm)-time network simplex algorithm for the shortest path problem

被引：10
|
作者：
Goldfarb, D [1 ]
Jin, ZY
机构：
[1] Columbia Univ, New York, NY 10027 USA
[2] GTE Labs Inc, Waltham, MA 02254 USA
来源：
OPERATIONS RESEARCH | 1999年 / 47卷 / 03期
关键词：
D O I：
10.1287/opre.47.3.445
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We present an O(nm)-time network simplex algorithm for finding a tree of shortest paths from a given node to all other nodes in a network of n nodes and m directed arcs or finding a directed cycle of negative length. The worst-case running time of this algorithm is as fast as that proved for any strongly polynomial algorithm and faster than that proved for any previously proposed simplex algorithm for this problem. We also show that this algorithm can be implemented in O(nlogn) time using O((m/logn) + n) exclusive read-exclusive write processors of a parallel random access machine.
引用
收藏
页码：445 / 448
页数：4
相关论文
共 50 条
  • [31] A New Practical Algorithm for the Shortest Path Problem
    Liu, Pan
    Kou, Miao Huai
    Ping, Yu Guo
    Liang, Yin
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 4120 - +
  • [32] AN APPROXIMATION ALGORITHM FOR A SHORTEST DUBINS PATH PROBLEM
    Rathinam, Sivakumar
    Khargonekar, Pramod
    PROCEEDINGS OF THE ASME 9TH ANNUAL DYNAMIC SYSTEMS AND CONTROL CONFERENCE, 2016, VOL 2, 2017,
  • [33] Solving the k-shortest path problem with time windows in a time varying network
    Androutsopoulos, Konstantinos N.
    Zografos, Konstantinos G.
    OPERATIONS RESEARCH LETTERS, 2008, 36 (06) : 692 - 695
  • [34] Shortest path problem of uncertain random network
    Sheng, Yuhong
    Gao, Yuan
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 97 - 105
  • [35] A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
    Wang, Rong-Long
    Guo, Shan-Shan
    Okazaki, Kozo
    SOFT COMPUTING, 2009, 13 (06) : 551 - 558
  • [36] A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
    Rong-Long Wang
    Shan-Shan Guo
    Kozo Okazaki
    Soft Computing, 2009, 13 : 551 - 558
  • [37] Reachability for airline networks: fast algorithm for shortest path problem with time windows
    Gao, Xiaofeng
    Xianzang, Yueyang
    You, Xiaotian
    Dang, Yaru
    Chen, Guihai
    Wang, Xinglong
    THEORETICAL COMPUTER SCIENCE, 2018, 749 : 66 - 79
  • [38] Fuzzy network decision for the shortest path problem
    Chuang, TN
    Kung, JY
    PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2003, : 1031 - 1034
  • [39] A GENERALIZED PERMANENT LABELING ALGORITHM FOR THE SHORTEST-PATH PROBLEM WITH TIME WINDOWS
    DESROCHERS, M
    SOUMIS, F
    INFOR, 1988, 26 (03) : 191 - 212
  • [40] The Polynomial Time Algorithm of the Next-to-shortest Path Problem in Directed Graph
    Zeng, Qinghong
    Yang, Qiaoyan
    2016 PPH INTERNATIONAL CONFERENCE ON SOCIAL SCIENCE AND ENVIRONMENT (PPH-SSE 2016), VOL 2, 2016, 7 : 89 - 92
12345