Robust minmax regret combinatorial optimization problems with a resource–dependent uncertainty polyhedron of scenarios

2019 ◽  
Vol 103 ◽  
pp. 97-108 ◽  
Author(s):  
Eduardo Conde
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problems ◽  
Combinatorial Optimization Problems ◽  
Minmax Regret

scholarly journals Minmax regret combinatorial optimization problems: an Algorithmic Perspective

2011 ◽  
Vol 45 (2) ◽  
pp. 101-129 ◽  
Author(s):  
Alfredo Candia-Véjar ◽  
Eduardo Álvarez-Miranda ◽  
Nelson Maculan
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problems ◽  
Combinatorial Optimization Problems ◽  
Minmax Regret

scholarly journals Combinatorial two-stage minmax regret problems under interval uncertainty

2020 ◽  
Author(s):  
Marc Goerigk ◽  
Adam Kasperski ◽  
Paweł Zieliński
Keyword(s):  
Combinatorial Optimization ◽  
Shortest Path ◽  
Feasible Solution ◽  
Optimization Problems ◽  
Interval Uncertainty ◽  
Combinatorial Optimization Problems ◽  
Second Stage ◽  
Minmax Regret ◽  
Uncertainty Set ◽  
Two Stages

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.

Sign in / Sign up

Export Citation Format

Share Document