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 条
  • [21] A Color Image Steganography Using A Chaotic Map Based On K-Least Significant Bits
    Celik, Hidayet
    Dogan, Nurettin
    JOURNAL OF POLYTECHNIC-POLITEKNIK DERGISI, 2023, 26 (02): : 679 - 692
  • [22] Finding the K shortest paths in a time-schedule network with constraints on arcs
    Jin, Wen
    Chen, Shuiping
    Jiang, Hai
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (12) : 2975 - 2982
  • [23] Finding the k Shortest Paths in Parallel
    E. Ruppert
    Algorithmica, 2000, 28 : 242 - 254
  • [24] Finding the k shortest paths in parallel
    Ruppert, E
    STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 475 - 486
  • [25] Finding the k shortest paths in parallel
    Ruppert, E
    ALGORITHMICA, 2000, 28 (02) : 242 - 254
  • [26] Finding K shortest and dissimilar paths
    Moghanni, Ali
    Pascoal, Marta
    Godinho, Maria Teresa
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (03) : 1573 - 1601
  • [27] Least-cost paths in mountainous terrain
    Rees, WG
    COMPUTERS & GEOSCIENCES, 2004, 30 (03) : 203 - 209
  • [28] The first K minimum cost paths in a time-schedule network
    Chen, YL
    Rinks, D
    Tang, K
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (01) : 102 - 108
  • [29] MapReduce-Enhanced Fuzzy K-Least Medians for Qualitative Clustering of Document Big Data
    Sardar, Tanvir Habib
    Ansari, Zahid Ahmed
    Theerthagiri, Prasannavenkatesan
    Karthikeyan, P.
    Ayyasamy, Vadivel
    Saini, Dilip Kumar Jang Bahadur
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2025, 37 (4-5):
  • [30] Heuristic methods for delay constrained least cost routing using k-shortest-paths
    Jia, ZF
    Varaiya, P
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2006, 51 (04) : 707 - 712
12345