SHORTEST PATHS IN NETWORKS WITH VECTOR WEIGHTS

被引：60

作者：

CORLEY, HW ^{[1
]}

MOON, ID ^{[1
]}

机构：

[1] RUTGERS STATE UNIV,GRAD SCH MANAGEMENT,NEWARK,NJ 07102

来源：

关键词：

D O I：

10.1007/BF00938761

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：79 / 86

页数：8

共 19 条

[1]

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

BLONIARZ, PA .

[3]

Christofides N., 1975, GRAPH THEORY ALGORIT

[4]

DANTZIG GB, 1960, MANAGEMENT SCI, V2, P187

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

DENARDO, EV ;

FOX, BL .

[6]

DEO N, 1974, GRAPH THEORY APPLICA

[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 LR, 1956, P923 RAND CORP REP