Complexity of the min-max and min-max regret assignment problems

被引：63
|
作者：
Aissi, H [1 ]
Bazgan, C [1 ]
Vanderpooten, D [1 ]
机构：
[1] Univ Paris 09, LAMSADE, F-75775 Paris, France
来源：
OPERATIONS RESEARCH LETTERS | 2005年 / 33卷 / 06期
关键词：
assignment problem; min-max; min-max regret; complexity; NP-hard;
D O I：
10.1016/j.orl.2004.12.002
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment problem is strongly NP-hard. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：634 / 640
页数：7
相关论文
共 50 条
  • [31] MIN-MAX INDICATOR
    VASILEV, SI
    SIDELNIKOV, ZI
    INSTRUMENTS AND EXPERIMENTAL TECHNIQUES, 1983, 26 (06) : 1325 - 1327
  • [32] On a min-max theorem
    Wu G.R.
    Huang W.H.
    Shen Z.H.
    Applied Mathematics-A Journal of Chinese Universities, 1997, 12 (3) : 293 - 298
  • [33] Cycle time assignment of min-max systems
    Tao, YG
    Chen, WD
    INTERNATIONAL JOURNAL OF CONTROL, 2003, 76 (18) : 1790 - 1799
  • [34] Max-min and min-max approximation problems for normal matrices revisited
    Liesen, Jörg
    Tichý, Petr
    1600, Kent State University (41): : 159 - 166
  • [35] Climate policies under climate model uncertainty: Max-min and min-max regret
    Rezai, Armon
    van der Ploeg, Frederick
    ENERGY ECONOMICS, 2017, 68 : 4 - 16
  • [36] MAX-MIN AND MIN-MAX APPROXIMATION PROBLEMS FOR NORMAL MATRICES REVISITED
    Liesen, Joerg
    Tichy, Petr
    ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS, 2014, 41 : 159 - 166
  • [37] Approximating the min-max (regret) selecting items problem
    Kasperski, Adam
    Kurpisz, Adam
    Zielinski, Pawel
    INFORMATION PROCESSING LETTERS, 2013, 113 (1-2) : 23 - 29
  • [38] A min-max regret approach to unbalanced bidding in construction
    Abbas Afshar
    Helia Amiri
    KSCE Journal of Civil Engineering, 2010, 14 : 653 - 661
  • [39] A min-max regret approach to unbalanced bidding in construction
    Afshar, Abbas
    Amiri, Helia
    KSCE JOURNAL OF CIVIL ENGINEERING, 2010, 14 (05) : 653 - 661
  • [40] Exact and heuristic algorithms for the interval min-max regret generalized assignment problem
    Wu, Wei
    Iori, Manuel
    Martello, Silvano
    Yagiura, Mutsunori
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 125 : 98 - 110
12345