AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS

被引：526

作者：

DREYFUS, SE

机构：

来源：

关键词：

D O I：

10.1287/opre.17.3.395

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：395 / &

共 37 条

[1]

[Anonymous], 1961, J MATH ANAL APPL

[2] ON KTH BEST POLICIES [J].

BELLMAN, R ;

KALABA, R .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (04) :582-588

[3]

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

[4] TRAVELING SALESMAN PROBLEM - A SURVEY [J].

BELLMORE, M ;

NEHAUSE.GL .

[5]

BERGE C, 1965, PROGRAMMING GAMES TR, P176

[6] COMPUTING THE N-BEST LOOPLESS PATHS IN A NETWORK [J].

CLARKE, S ;

KRIKORIAN, A ;

RAUSEN, J .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1963, 11 (04) :1096-1102

COOKE, KL ;

HALSEY, E .

[8]

Dantzig G. B., 1966, THEORIE GRAPHES, P91

[9] ON THE SHORTEST ROUTE THROUGH A NETWORK [J].

DANTZIG, GB .

[10]

DANTZIG GB, 1966, 662 STANF U OP RES H