THE SET OF EFFICIENT SOLUTIONS FOR MULTIPLE OBJECTIVE SHORTEST-PATH PROBLEMS

被引：40

|

作者：

WHITE, DJ

机构：

来源：

COMPUTERS & OPERATIONS RESEARCH | 1982年 / 9卷 / 02期

关键词：

D O I：

10.1016/0305-0548(82)90008-9

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

引用

收藏

页码：101 / 107

页数：7

相关论文

共 50 条

[1] APPROXIMATION OF PARETO OPTIMA IN MULTIPLE-OBJECTIVE, SHORTEST-PATH PROBLEMS
WARBURTON, A
OPERATIONS RESEARCH, 1987, 35 (01) : 70 - 79
[2] EFFICIENT INTERACTIVE METHODS FOR A CLASS OF MULTIATTRIBUTE SHORTEST-PATH PROBLEMS
HENIG, MI
MANAGEMENT SCIENCE, 1994, 40 (07) : 891 - 897
[3] SHORTEST-PATH PROBLEMS WITH NODE FAILURES
JAILLET, P
NETWORKS, 1992, 22 (06) : 589 - 605
[4] EFFICIENT SHORTEST-PATH SIMPLEX ALGORITHMS
GOLDFARB, D
HAO, JX
KAI, SR
OPERATIONS RESEARCH, 1990, 38 (04) : 624 - 628
[5] AN ANALYSIS OF STOCHASTIC SHORTEST-PATH PROBLEMS
BERTSEKAS, DP
TSITSIKLIS, JN
MATHEMATICS OF OPERATIONS RESEARCH, 1991, 16 (03) : 580 - 595
[6] THE SHORTEST-PATH PROBLEM WITH 2 OBJECTIVE FUNCTIONS
HENIG, MI
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 25 (02) : 281 - 291
[7] REDUCING SPACE REQUIREMENTS FOR SHORTEST-PATH PROBLEMS
MUNRO, JI
RAMIREZ, RJ
OPERATIONS RESEARCH, 1982, 30 (05) : 1009 - 1013
[8] SHORTEST-PATH PROBLEMS AND MOLECULAR-CONFORMATION
DRESS, AWM
HAVEL, TF
DISCRETE APPLIED MATHEMATICS, 1988, 19 (1-3) : 129 - 144
[9] PROBABILISTIC SHORTEST-PATH PROBLEMS WITH BUDGETARY CONSTRAINTS
BARD, JF
MILLER, JL
COMPUTERS & OPERATIONS RESEARCH, 1989, 16 (02) : 145 - 159
[10] AN INTERACTIVE APPROACH TO IDENTIFY THE BEST COMPROMISE SOLUTION FOR 2 OBJECTIVE SHORTEST-PATH PROBLEMS
CURRENT, JR
REVELLE, CS
COHON, JL
COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (02) : 187 - 198

← 1 2 3 4 5 →