SHORTEST-PATH METHODS - COMPLEXITY, INTERRELATIONS AND NEW PROPOSITIONS

被引：95

作者：

PALLOTTINO, S

机构：

来源：

关键词：

D O I：

10.1002/net.3230140206

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：257 / 267

页数：11

共 25 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

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

[3]

DANTZIG GB, 1967, 1966 P INT S THEOR G

[4] SHORTEST-ROUTE METHODS .1. REACHING, PRUNING, AND BUCKETS [J].

DENARDO, EV ;

FOX, BL .

DIAL, R ;

GLOVER, F ;

KARNEY, D ;

KLINGMAN, D .

[6] SHORTEST-PATH FOREST WITH TOPOLOGICAL ORDERING [J].

DIAL, RB .

[7]

Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

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

DREYFUS, SE .

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

FLOYD, RW .

[10]

FORD LJ, 1956, P293 RAND CORP REP