AN IMPROVED DISTRIBUTION ALGORITHM FOR SHORTEST PATHS PROBLEM

被引:0
|
作者
LAKHANI, GD
机构
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:855 / 857
页数:3
相关论文
共 50 条
  • [41] On an instance of the inverse shortest paths problem
    Burton, D.
    Toint, Ph.L.
    Mathematical Programming, Series A, 1992, 53 (1-6): : 45 - 61
  • [42] A NOTE ON THE PROBLEM OF UPDATING SHORTEST PATHS
    FUJISHIGE, S
    NETWORKS, 1981, 11 (03) : 317 - 319
  • [43] Intelligent Optimization Approach for the k Shortest Paths Problem Based on Genetic Algorithm
    Wang, Feng
    Man, Yuan
    Man, Lichun
    2014 10TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2014, : 219 - 224
  • [44] Research on the algorithm for K-shortest paths problem based on A* in complicated network
    Chen, Lichao
    Liu, Jia
    Zhang, Yingjun
    Xie, Binhong
    PROCEEDINGS OF THE SIXTH IEEE INTERNATIONAL CONFERENCE ON COGNITIVE INFORMATICS, 2007, : 419 - +
  • [45] An Improved Algorithm of the Shortest Path Search Problem in GIS Field
    Na, Zhao
    PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE ON COMMUNICATION, ELECTRONICS AND AUTOMATION ENGINEERING, 2013, 181 : 1035 - 1039
  • [46] Self-stabilizing algorithm for the shortest paths problem with a fully distributed demon
    Tsai, Ming-Shin
    Huang, Shing-Tsaan
    Parallel processing letters, 1994, 4 (1-2) : 65 - 72
  • [47] Research on the Shortest Path Problem Based on Improved Genetic Algorithm
    Wang, Baoliang
    Yao, Susu
    Lu, Kaining
    Zhao, Huizhen
    HUMAN CENTERED COMPUTING, HCC 2017, 2018, 10745 : 173 - 182
  • [48] SYSTOLIC ARRAY ALGORITHM FOR THE ALGEBRAIC PATH PROBLEM (SHORTEST PATHS; MATRIX INVERSION).
    Rote, Guenter
    Computing (Vienna/New York), 1985, 34 (03): : 191 - 219
  • [49] SASP: A symbolic algorithm for shortest paths
    Bock, P
    PROCEEDINGS ISAI/IFIS 1996 - MEXICO - USA COLLABORATION IN INTELLIGENT SYSTEMS TECHNOLOGIES, 1996, : 235 - 239
  • [50] A DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK
    HU, TC
    OPERATIONS RESEARCH, 1968, 16 (01) : 91 - &