A NEW POLYNOMIALLY BOUNDED SHORTEST-PATH ALGORITHM

被引：68

作者：

GLOVER, F ^{[1
]}

KLINGMAN, D ^{[1
]}

PHILLIPS, N ^{[1
]}

机构：

[1] UNIV TEXAS,AUSTIN,TX 78712

来源：

OPERATIONS RESEARCH | 1985年 / 33卷 / 01期

关键词：

D O I：

10.1287/opre.33.1.65

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：65 / 73

页数：9

共 19 条

[1]

Bellman R., 1958, Q APPL MATH, V16, P87

[2] SHORTEST-ROUTE METHODS .1. REACHING, PRUNING, AND BUCKETS [J].

DENARDO, EV ;

FOX, BL .

OPERATIONS RESEARCH, 1979, 27 (01) :161-186

[3] COMPUTATIONAL ANALYSIS OF ALTERNATIVE ALGORITHMS AND LABELING TECHNIQUES FOR FINDING SHORTEST PATH TREES [J].

DIAL, R ;

GLOVER, F ;

KARNEY, D ;

KLINGMAN, D .

NETWORKS, 1979, 9 (03) :215-248

[4]

Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[5] AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J].

DREYFUS, SE .

OPERATIONS RESEARCH, 1969, 17 (03) :395-&

[6] A DUAL SIMPLEX ALGORITHM FOR FINDING ALL SHORTEST PATHS [J].

FLORIAN, M ;

NGUYEN, S ;

PALLOTTINO, S .

NETWORKS, 1981, 11 (04) :367-378

[7]

Ford Jr L.R., 1956, NETWORK FLOW THEORY

[8] A NEW ALGORITHM TO FIND THE SHORTEST PATHS BETWEEN ALL PAIRS OF NODES [J].

GALLO, G ;

PALLOTTINO, S .

DISCRETE APPLIED MATHEMATICS, 1982, 4 (01) :23-35

[9]

GILSINN J, 1973, NBS772 US DEP COMM T

[10] COMPUTATIONAL STUDY OF AN IMPROVED SHORTEST-PATH ALGORITHM [J].

GLOVER, F ;

GLOVER, R ;

KLINGMAN, D .

NETWORKS, 1984, 14 (01) :25-36

← 1 2 →