Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
From MaRDI portal
Publication:1698883
DOI10.1016/j.ejor.2016.10.055zbMath1380.90233arXiv1606.01180OpenAlexW2547323698MaRDI QIDQ1698883
Marc Goerigk, André B. Chassein
Publication date: 16 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.01180
Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (7)
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty ⋮ Variable-sized uncertainty and inverse problems in robust optimization ⋮ Combinatorial optimization problems with balanced regret ⋮ Project net present value estimation under uncertainty ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ Compromise solutions for robust combinatorial optimization with variable-sized uncertainty ⋮ The impacts of retailers' regret aversion on a random multi-period supply chain network
Uses Software
Cites Work
- Unnamed Item
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- On exact solutions for the minmax regret spanning tree problem
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
- Complexity of the min-max and min-max regret assignment problems
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- Minimax regret solution to linear programming problems with an interval objective function
- On the robust shortest path problem.
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Interval data minmax regret network optimization problems
- On the complexity of minmax regret linear programming
- Robust Convex Optimization
- Theory and Applications of Robust Optimization
- The Price of Robustness
- On the complexity of a class of combinatorial optimization problems with uncertainty
This page was built for publication: Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
