On recoverable and two-stage robust selection problems with budgeted uncertainty-Reference-Cited by-同舟云学术

On recoverable and two-stage robust selection problems with budgeted uncertainty

Published:2018-03 Issue:2 Volume:265 Page:423-436
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Chassein André,Goerigk Marc,Kasperski Adam,Zieliński Paweł

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference28 articles.

1. Min-max and min-max regret versions of combinatorial optimization problems: A survey;Aissi;European Journal of Operational Research,2009

2. On the complexity of a class of combinatorial optimization problems with uncertainty;Averbakh;Mathematical Programming,2001

3. Robust discrete optimization and network flows;Bertsimas;Mathematical Programming,2003

4. The price of robustness;Bertsimas;Operations research,2004

5. Recoverable robust shortest path problems;Büsing;Networks,2012

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Benchmarking problems for robust discrete optimization;Computers & Operations Research;2024-06

2. A single representative min–max–min robust selection problem with alternatives and budgeted uncertainty;Discrete Applied Mathematics;2024-05

3. A preference elicitation approach for the ordered weighted averaging criterion using solution choice observations;European Journal of Operational Research;2024-05

4. On the complexity of robust multi-stage problems with discrete recourse;Discrete Applied Mathematics;2024-01

5. Robust Selection Problems;International Series in Operations Research & Management Science;2024