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 条
  • [31] Finding K shortest looping paths with waiting time in a time-window network
    Yang, HH
    Chen, YL
    APPLIED MATHEMATICAL MODELLING, 2006, 30 (05) : 458 - 465
  • [32] A Sequential algorithm for finding K Shortest Paths
    Tsvetanov, Sevdalin
    Marinova, Daniela
    PROCEEDINGS OF THE 44TH INTERNATIONAL CONFERENCE "APPLICATIONS OF MATHEMATICS IN ENGINEERING AND ECONOMICS", 2018, 2048
  • [33] A PARALLEL ALGORITHM FOR FINDING A BLOCKING FLOW IN AN ACYCLIC NETWORK
    GOLDBERG, AV
    TARJAN, RE
    INFORMATION PROCESSING LETTERS, 1989, 31 (05) : 265 - 271
  • [34] A SPECIAL CASE OF THE DYNAMIZATION PROBLEM FOR LEAST COST PATHS
    CRIPPA, D
    INFORMATION PROCESSING LETTERS, 1991, 39 (06) : 297 - 302
  • [35] K*: A heuristic search algorithm for finding the k shortest paths
    Aljazzar, Husain
    Leue, Stefan
    ARTIFICIAL INTELLIGENCE, 2011, 175 (18) : 2129 - 2154
  • [36] Finding minimum-cost paths with minimum sharability
    Zheng, S. Q.
    Yang, Bing
    Yang, Mei
    Wang, Jianping
    INFOCOM 2007, VOLS 1-5, 2007, : 1532 - +
  • [37] Addressing network survivability issues by finding the K-best paths through a trellis graph
    Nikolopoulos, SD
    Pitsillides, A
    Tipper, D
    IEEE INFOCOM '97 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, PROCEEDINGS, VOLS 1-3: SIXTEENTH ANNUAL JOINT CONFERENCE OF THE IEEE COMPUTER AND COMMUNICATIONS SOCIETIES - DRIVING THE INFORMATION REVOLUTION, 1997, : 370 - 377
  • [38] A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs
    Guo, Jianyuan
    Jia, Limin
    JOURNAL OF ALGORITHMS & COMPUTATIONAL TECHNOLOGY, 2017, 11 (02) : 170 - 177
  • [39] Finding least cost proofs using a hierarchical PSO
    Chivers, Shawn T.
    Tagliarini, Gene A.
    Abdelbar, Ashraf M.
    2007 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2007, : 156 - +
  • [40] Finding paths of length k in O*(2k) time
    Williams, Ryan
    INFORMATION PROCESSING LETTERS, 2009, 109 (06) : 315 - 318
12345