Recoverable Robust Combinatorial Optimization Problems

被引：6
作者：
Kasperski, Adam [1 ]
Kurpisz, Adam [2 ]
Zielinski, Pawel [2 ]
机构：
[1] Wroclaw Univ Technol, Inst Ind Engn & Management, Wybrzeze Wyspianskiego 27, PL-50370 Wroclaw, Poland
[2] Wroclaw Univ Technol, Fac Fundamental Problems Technol, PL-50370 Wroclaw, Poland
来源：
OPERATIONS RESEARCH PROCEEDINGS 2012 | 2014年
关键词：
MIN-MAX; COMPLEXITY; APPROXIMABILITY;
D O I：
10.1007/978-3-319-00795-3_22
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：147 / 153
页数：7
相关论文
共 9 条
  • [1] Aissi H, 2005, LECT NOTES COMPUT SC, V3827, P789, DOI 10.1007/11602613_79
  • [2] Complexity of the min-max and min-max regret assignment problems
    Aissi, H
    Bazgan, C
    Vanderpooten, D
    [J]. OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 634 - 640
  • [3] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
  • [4] On the complexity of a class of combinatorial optimization problems with uncertainty
    Averbakh, I
    [J]. MATHEMATICAL PROGRAMMING, 2001, 90 (02) : 263 - 272
  • [5] Recoverable robust shortest path problems
    Buesing, Christina
    [J]. NETWORKS, 2012, 59 (01) : 181 - 189
  • [6] Approximating the min-max (regret) selecting items problem
    Kasperski, Adam
    Kurpisz, Adam
    Zielinski, Pawel
    [J]. INFORMATION PROCESSING LETTERS, 2013, 113 (1-2) : 23 - 29
  • [7] On the approximability of robust spanning tree problems
    Kasperski, Adam
    Zielinski, Pawel
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (4-5) : 365 - 374
  • [8] On the approximability of minmax (regret) network optimization problems
    Kasperski, Adam
    Zieliniski, Pawel
    [J]. INFORMATION PROCESSING LETTERS, 2009, 109 (05) : 262 - 266
  • [9] Kouvelis P., 1997, NONCONVEX OPTIMIZATI
1