A DUAL SIMPLEX ALGORITHM FOR FINDING ALL SHORTEST PATHS

被引：21

作者：

FLORIAN, M

NGUYEN, S

PALLOTTINO, S

机构：

来源：

NETWORKS | 1981年 / 11卷 / 04期

关键词：

D O I：

10.1002/net.3230110406

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：367 / 378

页数：12

共 13 条

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

DENARDO, EV ;

FOX, BL .

OPERATIONS RESEARCH, 1979, 27 (01) :161-186

[2] COMPUTATIONAL ANALYSIS OF ALTERNATIVE ALGORITHMS AND LABELING TECHNIQUES FOR FINDING SHORTEST PATH TREES [J].

DIAL, R ;

GLOVER, F ;

KARNEY, D ;

KLINGMAN, D .

NETWORKS, 1979, 9 (03) :215-248

[3]

DIONNE R, 1978, INFOR, V16, P132

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

DREYFUS, SE .

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

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

FLOYD, RW .

COMMUNICATIONS OF THE ACM, 1962, 5 (06) :345-345

[6]

GALLO G, 1979, PUBLICATION CTR RECH, V132

[7]

GILSINN J, 1973, NBS772 US DEP COMM T

[8] EFFICIENT APPROACH TO SOLVING ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM [J].

LEBLANC, LJ ;

MORLOK, EK ;

PIERSKALLA, WP .

TRANSPORTATION RESEARCH, 1975, 9 (05) :309-318

[9]

MURCHLAND JD, 1970, THESIS KARLSRUHE U

[10]

NGUYEN S, 1975, PUBLICATION CTR RECH, V17

← 1 2 →