Combinatorial two-stage minmax regret problems under interval uncertainty
Data Structures and Algorithms
2020-05-22 v1
Abstract
In 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.
Keywords
Cite
@article{arxiv.2005.10610,
title = {Combinatorial two-stage minmax regret problems under interval uncertainty},
author = {Marc Goerigk and Adam Kasperski and Pawel Zielinski},
journal= {arXiv preprint arXiv:2005.10610},
year = {2020}
}