Combinatorial two-stage minmax regret problems under interval uncertainty
From MaRDI portal
Publication:2241200
DOI10.1007/s10479-020-03863-7zbMath1480.90210arXiv2005.10610OpenAlexW3110099830MaRDI QIDQ2241200
Marc Goerigk, Adam Kasperski, Paweł Zieliński
Publication date: 8 November 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.10610
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- The robust set covering problem with interval data
- The computational complexity of the relative robust shortest path problem with interval data
- On the approximability of robust spanning tree problems
- Exact and heuristic algorithms for the interval data robust assignment problem
- A branch and bound algorithm for the robust spanning tree problem with interval data
- Complexity of the min-max and min-max regret assignment problems
- Complexity of the min-max (regret) versions of min cut problems
- Commitment under uncertainty: Two-stage stochastic matching problems
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
- 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.
- On the complexity of the robust spanning tree problem with interval data
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Stochastic linear programming. Models, theory, and computation
- Interval data minmax regret network optimization problems
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- An exact algorithm for the robust shortest path problem with interval data
- Approximating the min-max (regret) selecting items problem
- Min max min robust (relative) regret combinatorial optimization
- Robust recoverable and two-stage selection problems
- Improved approximation algorithms for the Min-Max selecting items problem
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- A Benders decomposition approach for the robust spanning tree problem with interval data
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- The Theory of Statistical Decision
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The robust spanning tree problem with interval data
This page was built for publication: Combinatorial two-stage minmax regret problems under interval uncertainty
