Robust Two-Stage Network Problems

被引：2
|
作者：
Kasperski, Adam [1 ]
Zielinski, Pawel [2 ]
机构：
[1] Wroclaw Univ Technol, Fac Comp Sci & Management, Wroclaw, Poland
[2] Wroclaw Univ Technol, Fac Fundamental Problems Technol, Wroclaw, Poland
来源：
OPERATIONS RESEARCH PROCEEDINGS 2015 | 2017年
关键词：
REPRESENTATIVES SELECTION PROBLEM; APPROXIMABILITY;
D O I：
10.1007/978-3-319-42902-1_5
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper a class of network optimization problems is discussed. It is assumed that a partial solution can be formed in the first stage, when the arc costs are precisely known, and completed optimally in the second stage, after a true second-stage cost scenario occurs. The robust min-max criterion is used to compute an optimal solution. Several complexity results for the interval and discrete uncertainty representations are provided.
引用
收藏
页码：35 / 40
页数：6
相关论文
共 50 条
  • [1] Two-Stage robust optimization problems with two-stage uncertainty
    Goerigk, Marc
    Lendl, Stefan
    Wulf, Lasse
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 302 (01) : 62 - 78
  • [2] Robust recoverable recoverable and two-stage selection problems
    Kasperski, Adam
    Zielinski, Pawel
    [J]. DISCRETE APPLIED MATHEMATICS, 2017, 233 : 52 - 64
  • [3] Two-Stage Robust Network Design with Exponential Scenarios
    Khandekar, Rohit
    Kortsarz, Guy
    Mirrokni, Vahab
    Salavatipour, Mohammad R.
    [J]. ALGORITHMS - ESA 2008, 2008, 5193 : 589 - 600
  • [4] Two-stage Robust Network Design with Exponential Scenarios
    Khandekar, Rohit
    Kortsarz, Guy
    Mirrokni, Vahab
    Salavatipour, Mohammad R.
    [J]. ALGORITHMICA, 2013, 65 (02) : 391 - 408
  • [5] Two-stage Robust Network Design with Exponential Scenarios
    Rohit Khandekar
    Guy Kortsarz
    Vahab Mirrokni
    Mohammad R. Salavatipour
    [J]. Algorithmica, 2013, 65 : 391 - 408
  • [6] On recoverable and two-stage robust selection problems with budgeted uncertainty
    Chassein, Andre
    Goerigk, Marc
    Kasperski, Adam
    Zielinski, Pawel
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 265 (02) : 423 - 436
  • [7] The two-stage random robust network flow capacity expansion
    Bu Ru-Guo
    Huang Jun
    Yang Wen-Guo
    Liu Tie
    Alex
    [J]. PROCEEDINGS OF INTERNATIONAL SYMPOSIUM ON EMERGENCY MANAGEMENT 2011, 2012, : 162 - 165
  • [8] Two-stage network constrained robust unit commitment problem
    Jiang, Ruiwei
    Zhang, Muhong
    Li, Guang
    Guan, Yongpei
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 234 (03) : 751 - 762
  • [9] Robust Two-stage Graph Convolutional Network for Face Clustering
    Hou, Guanqun
    Deng, Fan
    Chen, Xinjia
    Lu, Haixian
    Che, Jun
    Pu, Shiliang
    [J]. 2022 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2022,
  • [10] Saddle point approximation approaches for two-stage robust optimization problems
    Ning Zhang
    Chang Fang
    [J]. Journal of Global Optimization, 2020, 78 : 651 - 670
12345