FINDING THE K-LEAST COST PATHS IN AN ACYCLIC ACTIVITY NETWORK

被引：9
|
作者：
HORNE, GJ
机构：
来源：
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1980年 / 31卷 / 05期
关键词：
D O I：
10.1057/jors.1980.79
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：443 / 448
页数：6
相关论文
共 50 条
  • [41] A minimax method for finding the k best ''differentiated'' paths
    Kuby, M
    Xu, ZY
    Xie, XD
    GEOGRAPHICAL ANALYSIS, 1997, 29 (04) : 298 - 313
  • [42] Finding Top-k Shortest Paths with Diversity
    Liu, Huiping
    Jin, Cheqing
    Yang, Bin
    Zhou, Aoying
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (03) : 488 - 502
  • [43] Finding k-shortest paths with limited overlap
    Chondrogiannis, Theodoros
    Bouros, Panagiotis
    Gamper, Johann
    Leser, Ulf
    Blumenthal, David B.
    VLDB JOURNAL, 2020, 29 (05): : 1023 - 1047
  • [44] Finding k-shortest paths with limited overlap
    Chondrogiannis, Theodoros
    Bouros, Panagiotis
    Gamper, Johann
    Leser, Ulf
    Blumenthal, David B.
    VLDB Journal, 2020, 29 (05): : 1023 - 1047
  • [45] Finding All Hops k-shortest Paths
    Cheng, G
    Ansari, N
    2003 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS, AND SIGNAL PROCESSING, VOLS 1 AND 2, CONFERENCE PROCEEDINGS, 2003, : 474 - 477
  • [46] Assigning traffic over essentially-least-cost paths
    Hunt, D.T.
    Kornhauser, A.L.
    Transportation Research Record, 1996, (1556): : 1 - 7
  • [47] Finding k-shortest paths with limited overlap
    Theodoros Chondrogiannis
    Panagiotis Bouros
    Johann Gamper
    Ulf Leser
    David B. Blumenthal
    The VLDB Journal, 2020, 29 : 1023 - 1047
  • [48] An efficient algorithm for computing least cost paths with turn constraints
    Boroujerdi, A
    Uhlmann, J
    INFORMATION PROCESSING LETTERS, 1998, 67 (06) : 317 - 321
  • [49] Least Cost Paths and Movement in Tonto Basin, Central Arizona
    Caseldine, Christopher R.
    KIVA-JOURNAL OF SOUTHWESTERN ANTHROPOLOGY AND HISTORY, 2022, 88 (01): : 112 - 141
  • [50] Efficient algorithm for computing least cost paths with turn constraints
    Naval Research Lab, Washington, United States
    Inf Process Lett, 6 (317-321):
12345