A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
From MaRDI portal
Publication:319447
DOI10.1016/j.ejor.2015.02.023zbMath1346.90697OpenAlexW2089903952MaRDI QIDQ319447
Marc Goerigk, André B. Chassein
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/3802
Related Items (15)
Algorithms and uncertainty sets for data-driven robust shortest path problems ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ A fully polynomial time approximation scheme for the probability maximizing shortest path problem ⋮ A double oracle approach to minmax regret optimization problems with interval data ⋮ Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees ⋮ Variable-sized uncertainty and inverse problems in robust optimization ⋮ Combinatorial optimization problems with balanced regret ⋮ Algorithms for the minmax regret path problem with interval data ⋮ Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets ⋮ Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions ⋮ Combinatorial two-stage minmax regret problems under interval uncertainty ⋮ Generating hard instances for robust combinatorial optimization ⋮ On scenario aggregation to approximate robust combinatorial optimization problems
Cites Work
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- 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
- Complexity of the min-max (regret) versions of min cut 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 discrete optimization and its applications
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Interval data minmax regret network optimization problems
- Robust optimization-methodology and applications
- On the complexity of minmax regret linear programming
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A quick method for finding shortest pairs of disjoint paths
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- The robust spanning tree problem with interval data
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
