Robust single-stage selection problems with budgeted uncertainty
From MaRDI portal
Cites work
- A linear time algorithm for the robust recoverable selection problem
- A note on the quickest minimum cost transshipment problem
- A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty
- Approximating the shortest path problem with scenarios
- Constrained flows in networks
- Generic machine-learning-augmented beam search for resource-constrained shortest path reformulations of combinatorial optimization problems
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
- On the complexity of robust multi-stage problems with discrete recourse
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust recoverable and two-stage selection problems
- Submodular maximization subject to a knapsack constraint: combinatorial algorithms with near-optimal adaptive complexity
- The maximum beer flow problem
- The polynomial-time hierarchy
- The Price of Robustness
- The trouble with the second quantifier
- Time bounds for selection
- Two algorithms for shortest-paths problems in edge-weighted directed graphs
- Two-stage robust optimization problems with two-stage uncertainty
- Yet harder knapsack problems
This page was built for publication: Robust single-stage selection problems with budgeted uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411122)
