A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
From MaRDI portal
Publication:2197476
DOI10.1016/J.DAM.2020.07.002zbMATH Open1450.90039OpenAlexW3040702680MaRDI QIDQ2197476FDOQ2197476
Authors: Christoph Buchheim 
Publication date: 31 August 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.07.002
Recommendations
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
- Min-max-min robust combinatorial optimization
- An active set algorithm for robust combinatorial optimization based on separation oracles
- An active set algorithm for robust combinatorial optimization based on separation oracles
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
Cites Work
- Robust discrete optimization and network flows
- Robust convex optimization
- Approximation algorithms for reliable stochastic combinatorial optimization
- Complexity of the min-max and min-max regret assignment problems
- Complexity of the min-max (regret) versions of min cut problems
- Robust combinatorial optimization with knapsack uncertainty
- A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
- Robust combinatorial optimization under convex and discrete cost uncertainty
Cited In (5)
- A note on robustness tolerances for combinatorial optimization problems
- Title not available (Why is that?)
- Robust algorithms: a different approach to oracles
- An oracle-based framework for robust combinatorial optimization
- An active set algorithm for robust combinatorial optimization based on separation oracles
This page was built for publication: A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197476)
