SOLUTION OF ROUTING PROBLEM THROUGH A NETWORK-BY A MATRIX METHOD WITH AUXILIARY NODES

被引：5

作者：

MORI, M

NISHIMUR.T

机构：

来源：

TRANSPORTATION RESEARCH | 1967年 / 1卷 / 02期

关键词：

D O I：

10.1016/0041-1647(67)90170-0

中图分类号：

TU [建筑科学];

学科分类号：

0813 ;

摘要：

引用

页码：165 / &

共 10 条

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

KATO A, 1966, T JAPAN SOC CIV ENGR, V129, P23

[4]

Kitamura M., 1965, 8 JAP ROAD C, P66

[5] A DECOMPOSITION ALGORITHM FOR SHORTEST-ROUTE PROBLEM [J].

MILLS, G .

[6]

MORI M, 1963, MEMOIRS FACULTY ENGI, V5, P149

[7] SOLUTIONS OF THE SHORTEST-ROUTE PROBLEM - A REVIEW [J].

POLLACK, M ;

WIEBENSON, W .

[8] THE MAXIMUM CAPACITY THROUGH A NETWORK [J].

POLLACK, M .

[9]

SHIMBEL A, 1954, P S INFORMATION NETS

[10]

TAKAHASHI I, 1966, J OPS RES SOC JAPAN, V11, P37