Combinatorial two-stage minmax regret problems under interval uncertainty-Reference-Cited by-同舟云学术

Combinatorial two-stage minmax regret problems under interval uncertainty

Published:2020-11-24 Issue:1 Volume:300 Page:23-50
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Goerigk Marc,Kasperski Adam^ORCID,Zieliński Paweł^ORCID

Abstract

AbstractIn this paper a class of combinatorial optimization problems is discussed. It is assumed that a feasible solution can be constructed in two stages. In the first stage the objective function costs are known while in the second stage they are uncertain and belong to an interval uncertainty set. In order to choose a solution, the minmax regret criterion is used. Some general properties of the problem are established and results for two particular problems, namely the shortest path and the selection problem, are shown.

Funder

Narodowe Centrum Nauki

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

https://link.springer.com/content/pdf/10.1007/s10479-020-03863-7.pdf

Reference37 articles.

1. Aissi, H., Bazgan, C., & Vanderpooten, D. (2005). Complexity of the min–max and min–max regret assignment problems. Operations Research Letters, 33, 634–640.

2. Aissi, H., Bazgan, C., & Vanderpooten, D. (2008). Complexity of the min–max (regret) versions of min cut problems. Discrete Optimization, 5, 66–73.

3. Aissi, H., Bazgan, C., & Vanderpooten, D. (2009). Min–max and min–max regret versions of combinatorial optimization problems: A survey. European Journal of Operational Research, 197, 427–438.

4. Aron, I. D., & van Hentenryck, P. (2004). On the complexity of the robust spanning tree problem with interval data. Operations Research Letters, 32, 36–40.

5. Averbakh, I. (2001). On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming, 90, 263–272.

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

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

2. Other Models for Robust Optimization;International Series in Operations Research & Management Science;2024

3. Combinatorial optimization problems with balanced regret;Discrete Applied Mathematics;2023-03