ROUTING THROUGH A NETWORK WITH MAXIMUM RELIABILITY

被引：11

作者：

ROOSTA, M

机构：

来源：

关键词：

D O I：

10.1016/0022-247X(82)90197-4

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：341 / 347

页数：7

共 9 条

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

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

[3]

Christofides N., 1975, GRAPH THEORY ALGORIT

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

DREYFUS, SE .

[5]

Ford L. R., 1962, FLOWS NETWORKS

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

HOFFMAN, W ;

PAVLEY, R .

[7]

Kleinrock L., 1976, QUEUEING SYSTEMS

[8] QUEUING MODELS FOR COMPUTER COMMUNICATIONS-SYSTEM ANALYSIS [J].

KOBAYASHI, H ;

KONHEIM, AG .

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

POLLACK, M .