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 条
  • [11] FINDING PATHS AND DELETING EDGES IN DIRECTED ACYCLIC GRAPHS
    ITALIANO, GF
    INFORMATION PROCESSING LETTERS, 1988, 28 (01) : 5 - 11
  • [12] Finding least common ancestors in directed acyclic graphs
    Bender, MA
    Pemmasani, G
    Skiena, S
    Sumazin, P
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 845 - 854
  • [13] Finding the k shortest paths
    Department of Information and Computer Science, University of California, Irvine, CA 92697-3425, United States
    SIAM J Comput, 2 (652-673):
  • [14] Finding the k shortest paths
    Eppstein, D
    SIAM JOURNAL ON COMPUTING, 1998, 28 (02) : 652 - 673
  • [15] COMPUTATIONAL EXPERIENCE WITH AN ALGORITHM FOR FINDING K-SHORTEST PATHS IN A NETWORK
    SHIER, DR
    JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1974, B 78 (03): : 139 - 165
  • [16] Finding least-cost paths across a continuous raster surface with discrete vector networks
    Choi, Yosoon
    Um, Jeong-Gi
    Park, Myong-Ho
    CARTOGRAPHY AND GEOGRAPHIC INFORMATION SCIENCE, 2014, 41 (01) : 75 - 85
  • [17] Finding the K shortest paths in a schedule-based transit network
    Xu, Wangtu
    He, Shiwei
    Song, Rui
    Chaudhry, Sohail S.
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (08) : 1812 - 1826
  • [18] Finding the first K shortest paths in a time-window network
    Chen, YL
    Yang, HH
    COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (04) : 499 - 513
  • [19] Finding K shortest looping paths in a traffic-light network
    Yang, HH
    Chen, YL
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (03) : 571 - 581
  • [20] FINDING PATHS THROUGH A NETWORK
    SLOANE, NJA
    BELL SYSTEM TECHNICAL JOURNAL, 1972, 51 (02): : 371 - +
12345