Combinatorial two-stage minmax regret problems under interval uncertainty

05/21/2020
by   Marc Goerigk, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2019

Robust two-stage combinatorial optimization problems under convex uncertainty

In this paper a class of robust two-stage combinatorial optimization pro...
research
12/19/2018

Two-stage Combinatorial Optimization Problems under Risk

In this paper a class of combinatorial optimization problems is discusse...
research
03/17/2020

Algorithms for the Minmax Regret Path Problem with Interval Data

The Shortest Path in networks is an important problem in Combinatorial O...
research
05/18/2022

On the multi-stage shortest path problem under distributional uncertainty

In this paper we consider an ambiguity-averse multi-stage network game b...
research
11/24/2021

Combinatorial Optimization Problems with Balanced Regret

For decision making under uncertainty, min-max regret has been establish...
research
12/03/2019

Soft robust solutions to possibilistic optimization problems

This paper discusses a class of uncertain optimization problems, in whic...
research
12/12/2012

A constraint satisfaction approach to the robust spanning tree problem with interval data

Robust optimization is one of the fundamental approaches to deal with un...

Please sign up or login with your details

Forgot password? Click here to reset