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

被引:40
|
作者
WHITE, DJ
机构
关键词
D O I
10.1016/0305-0548(82)90008-9
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
引用
收藏
页码:101 / 107
页数:7
相关论文
共 50 条
  • [11] A COMPUTATIONAL STUDY OF EFFICIENT SHORTEST-PATH ALGORITHMS
    HUNG, MS
    DIVOKY, JJ
    COMPUTERS & OPERATIONS RESEARCH, 1988, 15 (06) : 567 - 576
  • [12] A SHORT PATH TO THE SHORTEST-PATH
    LAX, PD
    AMERICAN MATHEMATICAL MONTHLY, 1995, 102 (02): : 158 - 159
  • [13] Parallel algorithms for solving aggregated shortest-path problems
    Romeijn, HE
    Smith, RL
    COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (10-11) : 941 - 953
  • [14] ARC TOLERANCES IN SHORTEST-PATH AND NETWORK FLOW PROBLEMS
    SHIER, DR
    WITZGALL, C
    NETWORKS, 1980, 10 (04) : 277 - 291
  • [15] A PARAMETRIC APPROACH TO SOLVING BICRITERION SHORTEST-PATH PROBLEMS
    MOTE, J
    MURTHY, I
    OLSON, DL
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 53 (01) : 81 - 92
  • [16] A bi-objective approach for shortest-path network interdiction
    Rocco S, Claudio M.
    Ramirez-Marquez, Jose Emmanuel
    COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 59 (02) : 232 - 240
  • [17] SOLVING CONSTRAINED SHORTEST-PATH PROBLEMS IN A UNIFIED WAY
    CHEN, YL
    CHIN, YH
    COMPUTING AND INFORMATION, 1989, : 57 - 63
  • [18] SHORTEST-PATH MOTION
    PAPADIMITRIOU, CH
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 241 : 144 - 153
  • [19] Randomized Shortest-Path Problems: Two Related Models
    Saerens, Marco
    Achbany, Youssef
    Fouss, Francois
    Yen, Luh
    NEURAL COMPUTATION, 2009, 21 (08) : 2363 - 2404
  • [20] A HEURISTIC APPROACH TO HARD CONSTRAINED SHORTEST-PATH PROBLEMS
    RIBEIRO, CC
    MINOUX, M
    DISCRETE APPLIED MATHEMATICS, 1985, 10 (02) : 125 - 137