On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
From MaRDI portal
Publication:2664004
Recommendations
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
- Min-max-min robust combinatorial optimization
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
Cites work
- $K$-adaptability in two-stage distributionally robust binary programming
- K-adaptability in two-stage robust binary programming
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- Adjustable robust solutions of uncertain linear programs
- AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Distributionally robust optimization and its tractable approximations
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
- Finite Adaptability in Multistage Linear Optimization
- Generalized light robustness and the trade-off between robustness and nominal quality
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Light robustness
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Min-max-min robust combinatorial optimization
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- On the recoverable robust traveling salesman problem
- Parallel recognition of series-parallel graphs
- Recent advances in robust optimization: an overview
- Recoverable Robust Combinatorial Optimization Problems
- Robust discrete optimization and network flows
- Robust optimization
- Robustness in operational research and decision aiding: a multi-faceted issue
- The concept of recoverable robustness, linear programming recovery, and railway applications
- The Price of Robustness
- Theory and applications of robust optimization
Cited in
(14)- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
- Two-stage robust optimization problems with two-stage uncertainty
- Matroid bases with cardinality constraints on the intersection
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
- Bulk-robust combinatorial optimization
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives
- A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty
- On the complexity of robust multi-stage problems with discrete recourse
- Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty
This page was built for publication: On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664004)
