APPROXIMATION OF PARETO OPTIMA IN MULTIPLE-OBJECTIVE, SHORTEST-PATH PROBLEMS

被引：215

作者：

WARBURTON, A

机构：

来源：

关键词：

D O I：

10.1287/opre.35.1.70

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：70 / 79

页数：10

共 30 条

[1] SHORTEST CHAIN SUBJECT TO SIDE CONSTRAINTS [J].

ANEJA, YP ;

AGGARWAL, V ;

NAIR, KPK .

[2]

Bellman R., 1957, DYNAMIC PROGRAMMING

[3] DYNAMIC PROGRAMMING IN MULTIPLICATIVE LATTICES [J].

BROWN, TA ;

STRAUCH, RE .

[4]

COX R, 1980, TIMS ORSA M COLORADO

[5]

COX RG, 1984, THESIS CORNELL U

[6] NOTE ON MULTIPLE OBJECTIVE DYNAMIC-PROGRAMMING [J].

DAELLENBACH, HG ;

DEKLUYVER, CA .

[7]

Floyd R. W., 1962, COMMUN ACM, V5, P362

[8]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[9] A DUAL ALGORITHM FOR THE CONSTRAINED SHORTEST-PATH PROBLEM [J].

HANDLER, GY ;

ZANG, I .

[10]

HARTLEY R, 1979, NOTES DECISION THEOR, V86