A NOTE ON THE PARTITIONING SHORTEST-PATH ALGORITHM

被引：4

作者：

DESROCHERS, M ^{[1
]}

机构：

[1] CTR MATH & COMP SCI,1009 AB AMSTERDAM,NETHERLANDS

来源：

OPERATIONS RESEARCH LETTERS | 1987年 / 6卷 / 04期

关键词：

Consider a directed network G ffi (N; A) with node set N and arc set A. We denote the cardinality of N and A by I'NI and [AI. Let i(i; j) denote the arc length for arc (i; 'j)¢ A. We as- * This research was partly support~ by a NATO Science Fellowship obtained through the Natural Sciences and En-gineering Research Council of Canada. Author's current address: GERAD; Ecole des HEC; 5255; Deeelles; Montreal; Quebec; Canada H3T 1V6;

D O I：

10.1016/0167-6377(87)90017-4

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：183 / 187

页数：5

共 8 条

[1] COMPUTATIONAL ANALYSIS OF ALTERNATIVE ALGORITHMS AND LABELING TECHNIQUES FOR FINDING SHORTEST PATH TREES
DIAL, R
GLOVER, F
KARNEY, D
KLINGMAN, D
[J]. NETWORKS, 1979, 9 (03) : 215 - 248
[2] GALLO G, 1986, MATH PROGRAM STUD, V26, P38, DOI 10.1007/BFb0121087
[3] GALLO G, 1984, TRANSPORTATION PLANN, P227
[4] A NEW POLYNOMIALLY BOUNDED SHORTEST-PATH ALGORITHM
GLOVER, F
KLINGMAN, D
PHILLIPS, N
[J]. OPERATIONS RESEARCH, 1985, 33 (01) : 65 - 73
[5] NEW POLYNOMIAL SHORTEST-PATH ALGORITHMS AND THEIR COMPUTATIONAL ATTRIBUTES
GLOVER, F
KLINGMAN, DD
PHILLIPS, NV
SCHNEIDER, RF
[J]. MANAGEMENT SCIENCE, 1985, 31 (09) : 1106 - 1128
[6] GLOVER F, 1987, 873 U COL GRAD SCH B
[7] Pape U., 1974, Mathematical Programming, V7, P212, DOI 10.1007/BF01585517
[8] PROPERTIES OF LABELING METHODS FOR DETERMINING SHORTEST-PATH TREES
SHIER, DR
WITZGALL, C
[J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS, 1981, 86 (03): : 317 - 330

← 1 →