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
关键词
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
相关论文
共 50 条
  • [1] Decomposition approaches for recoverable robust optimization problems
    van den Akker, J. M.
    Bouman, P. C.
    Hoogeveen, J. A.
    Tonissen, D. D.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 251 (03) : 739 - 750
  • [2] On scenario aggregation to approximate robust combinatorial optimization problems
    André Chassein
    Marc Goerigk
    Optimization Letters, 2018, 12 : 1523 - 1533
  • [3] On scenario aggregation to approximate robust combinatorial optimization problems
    Chassein, Andre
    Goerigk, Marc
    OPTIMIZATION LETTERS, 2018, 12 (07) : 1523 - 1533
  • [4] Representative scenario construction and preprocessing for robust combinatorial optimization problems
    Marc Goerigk
    Martin Hughes
    Optimization Letters, 2019, 13 : 1417 - 1431
  • [5] A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
    Eduardo Álvarez-Miranda
    Ivana Ljubić
    Paolo Toth
    4OR, 2013, 11 : 349 - 360
  • [6] Robust combinatorial optimization problems under budgeted interdiction uncertainty
    Goerigk, Marc
    Khosravi, Mohammad
    OR SPECTRUM, 2025, 47 (01) : 255 - 285
  • [7] A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
    Alvarez-Miranda, Eduardo
    Ljubic, Ivana
    Toth, Paolo
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2013, 11 (04): : 349 - 360
  • [8] Representative scenario construction and preprocessing for robust combinatorial optimization problems
    Goerigk, Marc
    Hughes, Martin
    OPTIMIZATION LETTERS, 2019, 13 (06) : 1417 - 1431
  • [9] Robust recoverable recoverable and two-stage selection problems
    Kasperski, Adam
    Zielinski, Pawel
    DISCRETE APPLIED MATHEMATICS, 2017, 233 : 52 - 64
  • [10] Robust recoverable 0-1 optimization problems under polyhedral uncertainty
    Hradovich, Mikita
    Kasperski, Adam
    Ziehriski, Pawel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 278 (01) : 136 - 148