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 条

[1] FINDING THE K QUICKEST SIMPLE PATHS IN A NETWORK
CHEN, YL
INFORMATION PROCESSING LETTERS, 1994, 50 (02) : 89 - 92
[2] FINDING K SHORTEST LOOPLESS PATHS IN A NETWORK
YEN, JY
MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 17 (11): : 712 - 716
[3] A genetic algorithm for finding the k shortest paths in a network
Hamed, Ahmed Younes
EGYPTIAN INFORMATICS JOURNAL, 2010, 11 (02) : 75 - 79
[4] ALGORITHMS FOR FINDING THE K-SHORTEST PATHS IN A NETWORK
SHIER, DR
NETWORKS, 1979, 9 (03) : 195 - 214
[5] AN ALGORITHM FOR FINDING THE K-QUICKEST PATHS IN A NETWORK
CHEN, YL
COMPUTERS & OPERATIONS RESEARCH, 1993, 20 (01) : 59 - 65
[6] Finding rectilinear least cost paths in the presence of convex polygonal congested regions
Sarkar, Avdit
Batta, Rajan
Nagi, Rakesh
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (03) : 737 - 754
[7] Finding disjoint paths on directed acyclic graphs
Tholey, T
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 319 - 330
[8] Finding Least Fuel Emission Paths in a Network with Time-Varying Speeds
Qian, Jiani
Eglese, Richard
NETWORKS, 2014, 63 (01) : 96 - 106
[9] FINDING A HOMOTOPY BASE FOR DIRECTED PATHS IN AN ACYCLIC GRAPH
MUROTA, K
FUJISHIGE, S
DISCRETE APPLIED MATHEMATICS, 1987, 17 (1-2) : 157 - 162
[10] Finding paths with the right cost
Nykänen, M
Ukkonen, E
STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 345 - 355

← 1 2 3 4 5 →