AN ALGORITHM FOR FINDING SHORTEST ROUTES FROM ALL SOURCE NODES TO A GIVEN DESTINATION IN GENERAL NETWORKS

被引：201

作者：

YEN, JY

机构：

来源：

关键词：

D O I：

10.1090/qam/253822

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：526 / &

共 15 条

[1]

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

[2]

DANTZIG GB, 1966, 662 STANF U OP RES H

[3]

DANTZIG GB, 1966, 663 STANF U OP RES H

[4]

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

[5]

Dreyfus S., 1968, RM54331PR RAND CORP

[6]

DREYFUS SE, 1967, RM5433PR RAND CORP M

[7] ALGORITHM-97 - SHORTEST PATH [J].

FLOYD, RW .

[8]

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

[9] REVISED MATRIX ALGORITHMS FOR SHORTEST PATHS [J].

HU, TC .

[10] A DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK [J].

HU, TC .