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 条
  • [21] PERFORMANCE OF SHORTEST-PATH ALGORITHMS IN NETWORK FLOW PROBLEMS
    DIVOKY, JJ
    HUNG, MS
    MANAGEMENT SCIENCE, 1990, 36 (06) : 661 - 673
  • [22] SHORTEST-PATH PROBLEMS WITH TIME WINDOWS ON NODES AND ARCS
    SANCHO, NGF
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1994, 186 (03) : 643 - 648
  • [23] Efficient Solutions for Stochastic Shortest Path Problems with Dead Ends
    Trevizan, Felipe
    Teichteil-Konigsbuch, Florent
    Thiebaux, Sylvie
    CONFERENCE ON UNCERTAINTY IN ARTIFICIAL INTELLIGENCE (UAI2017), 2017,
  • [24] A HIGHLY PARALLEL ALGORITHM FOR MULTISTAGE OPTIMIZATION PROBLEMS AND SHORTEST-PATH PROBLEMS
    ANTONIO, JK
    TSAI, WK
    HUANG, GM
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 12 (03) : 213 - 222
  • [25] Speeding up Martins' algorithm for multiple objective shortest path problems
    Demeyer, Sofie
    Goedgebeur, Jan
    Audenaert, Pieter
    Pickavet, Mario
    Demeester, Piet
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2013, 11 (04): : 323 - 348
  • [26] Speeding up Martins’ algorithm for multiple objective shortest path problems
    Sofie Demeyer
    Jan Goedgebeur
    Pieter Audenaert
    Mario Pickavet
    Piet Demeester
    4OR, 2013, 11 : 323 - 348
  • [27] Knapsack: Connectedness, Path, and Shortest-Path
    Dey, Palash
    Kolay, Sudeshna
    Singh, Sipra
    LATIN 2024: THEORETICAL INFORMATICS, PT II, 2024, 14579 : 162 - 176
  • [28] A label correcting approach for solving bicriterion shortest-path problems
    Skriver, AJV
    Andersen, KA
    COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (06) : 507 - 524
  • [30] Regularised shortest-path extraction
    Buckley, M
    Yang, J
    PATTERN RECOGNITION LETTERS, 1997, 18 (07) : 621 - 629