Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
From MaRDI portal
Publication:1731817
Recommendations
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Robust combinatorial optimization with knapsack uncertainty
- Robust combinatorial optimization with variable budgeted uncertainty
- Robust combinatorial optimization with locally budgeted uncertainty
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
Cites work
- Adjustable robust solutions of uncertain linear programs
- Algorithms and Computation
- Approximation algorithms for reliable stochastic combinatorial optimization
- Bulk-robust combinatorial optimization
- Complexity of the min-max and min-max regret assignment problems
- Core problems in knapsack algorithms
- Lagrangean decomposition for mean-variance combinatorial optimization
- Light robustness
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Optimization Methods in Finance
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust Solutions to Uncertain Semidefinite Programs
- Robust combinatorial optimization with variable budgeted uncertainty
- Robust convex optimization
- Robust discrete optimization and network flows
- Robust linear optimization under general norms.
- Robust optimization
- Robust optimization-methodology and applications
- Robust solutions of uncertain linear programs
- Submodular functions and optimization.
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The concept of recoverable robustness, linear programming recovery, and railway applications
- Theory and applications of robust optimization
- \(K\)-adaptability in two-stage robust binary programming
Cited in
(6)- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Γ‐robust linear complementarity problems with ellipsoidal uncertainty sets
- Robust combinatorial optimization with locally budgeted uncertainty
- Recycling inequalities for robust combinatorial optimization with budget uncertainty
- Robust combinatorial optimization with knapsack uncertainty
- Robust combinatorial optimization with variable budgeted uncertainty
This page was built for publication: Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1731817)
