FINDING K SHORTEST LOOPLESS PATHS IN A NETWORK

被引：1756

作者：

YEN, JY ^{[1
]}

机构：

[1] UNIV SANTA CLARA,SANTA CLARA,CA 95053

来源：

MANAGEMENT SCIENCE SERIES A-THEORY | 1971年 / 17卷 / 11期

关键词：

D O I：

10.1287/mnsc.17.11.712

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：712 / 716

页数：5

共 12 条

[1] ON KTH BEST POLICIES [J].

BELLMAN, R ;

KALABA, R .

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

[2]

BOCK F, 1957, ALGORITHM FINDING RA

[3] 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

[4]

Dijkstra E.W., 1959, NUMER MATH, V1, P269, DOI [DOI 10.1007/BF01386390, /10.1007/BF01386390]

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

DREYFUS, SE .

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

[6] A METHOD FOR THE SOLUTION OF THE NTH BEST PATH PROBLEM [J].

HOFFMAN, W ;

PAVLEY, R .

JOURNAL OF THE ACM, 1959, 6 (04) :506-514

[7] THE KTH BEST ROUTE THROUGH A NETWORK [J].

POLLACK, M .

OPERATIONS RESEARCH, 1961, 9 (04) :578-580

[8]

Pollack M., 1961, J MATH ANAL APPL, V13, P47

[9]

SAKAROVITCH M, 1966, ORC32 U CAL OPNS RES

[10]

Yen J. Y., 1970, THESIS U CALIFORNIA

← 1 2 →