AN EMPIRICAL-INVESTIGATION OF SOME BICRITERION SHORTEST-PATH ALGORITHMS

被引：91

作者：

BRUMBAUGHSMITH, J ^{[1
]}

SHIER, D ^{[1
]}

机构：

[1] COLL WILLIAM & MARY,DEPT MATH,WILLIAMSBURG,VA 23185

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1989年 / 43卷 / 02期

关键词：

D O I：

10.1016/0377-2217(89)90215-4

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：216 / 224

页数：9

共 15 条

[1]

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

[2]

CLIMACO JCN, 1982, EUR J OPER RES, V11, P399, DOI 10.1016/0377-2217(82)90205-3

[3] THE SHORTEST COVERING PATH PROBLEM - AN APPLICATION OF LOCATIONAL CONSTRAINTS TO NETWORK DESIGN [J].

CURRENT, J ;

REVELLE, C ;

COHON, J .

JOURNAL OF REGIONAL SCIENCE, 1984, 24 (02) :161-183

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

[5]

Hansen P., 1980, LECTURE NOTES EC MAT, P109, DOI DOI 10.1007/978-3-642-48782-8_9

[6] THE SHORTEST-PATH PROBLEM WITH 2 OBJECTIVE FUNCTIONS [J].

HENIG, MI .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 25 (02) :281-291

[7]

Hu T.C., 1969, INTEGER PROGRAMMING

[8] OPTIMAL PATHS IN GRAPHS WITH STOCHASTIC OR MULTIDIMENSIONAL WEIGHTS [J].

LOUI, RP .

COMMUNICATIONS OF THE ACM, 1983, 26 (09) :670-676

[9]

MARCHET JC, 1979, LAMSADE231979 U PAR

[10]

Pape U., 1974, Mathematical Programming, V7, P212, DOI 10.1007/BF01585517

← 1 2 →