A NOTE ON THE PARTITIONING SHORTEST-PATH ALGORITHM

被引:4
|
作者
DESROCHERS, M [1 ]
机构
[1] CTR MATH & COMP SCI,1009 AB AMSTERDAM,NETHERLANDS
关键词
Consider a directed network G ffi (N; A) with node set N and arc set A. We denote the cardinality of N and A by I'NI and [AI. Let i(i; j) denote the arc length for arc (i; 'j)¢ A. We as- * This research was partly support~ by a NATO Science Fellowship obtained through the Natural Sciences and En-gineering Research Council of Canada. Author's current address: GERAD; Ecole des HEC; 5255; Deeelles; Montreal; Quebec; Canada H3T 1V6;
D O I
10.1016/0167-6377(87)90017-4
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
9
引用
收藏
页码:183 / 187
页数:5
相关论文
共 50 条
  • [21] An incremental algorithm for a generalization of the shortest-path problem
    Computer Science Department, University of Wisconsin-Madison, 1210 West Dayton Street, Madison, Wisconsin 53706
    [J]. J Algorithms, 2 (267-305):
  • [22] AN ALGORITHM FOR SHORTEST-PATH MOTION IN 3 DIMENSIONS
    PAPADIMITRIOU, CH
    [J]. INFORMATION PROCESSING LETTERS, 1985, 20 (05) : 259 - 263
  • [23] A Hybrid Algorithm for the shortest-path problem in the graph
    Aghaei, Mohammad Reza Soltan
    Zukarnain, Zuriati Ahmad
    Mamat, Ali
    Zainuddin, Hishamuddin
    [J]. 2008 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER THEORY AND ENGINEERING, 2008, : 251 - +
  • [24] A DISTRIBUTED SHORTEST-PATH ALGORITHM FOR A PLANAR NETWORK
    FREDERICKSON, GN
    [J]. INFORMATION AND COMPUTATION, 1990, 86 (02) : 140 - 159
  • [25] COMPUTATIONAL STUDY OF AN IMPROVED SHORTEST-PATH ALGORITHM
    GLOVER, F
    GLOVER, R
    KLINGMAN, D
    [J]. NETWORKS, 1984, 14 (01) : 25 - 36
  • [26] A SUCCESSIVE SHORTEST-PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM
    ENGQUIST, M
    [J]. INFOR, 1982, 20 (04) : 370 - 384
  • [27] A SHORT PATH TO THE SHORTEST-PATH
    LAX, PD
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1995, 102 (02): : 158 - 159
  • [28] AN OPTIMAL SHORTEST-PATH PARALLEL ALGORITHM FOR PERMUTATION GRAPHS
    IBARRA, OH
    ZHENG, Q
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 24 (01) : 94 - 99
  • [29] ALGORITHM FOR SHORTEST-PATH MOTION IN THREE DIMENSIONS.
    Papadimitriou, Christos H.
    [J]. 1600, (20):
  • [30] SHORTEST-PATH MOTION
    PAPADIMITRIOU, CH
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 241 : 144 - 153