2-stage robust MILP with continuous recourse variables
From MaRDI portal
Publication:2449080
Recommendations
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- Two-stage robust optimization, state-space representable uncertainty and applications
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- Two-stage robust mixed integer programming problem with objective uncertainty
Cites work
- Adjustable robust solutions of uncertain linear programs
- Combinatorial optimization. Theory and algorithms.
- Linear programming under uncertainty
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- Robust discrete optimization and its applications
- Robust linear optimization under general norms.
- Robust location transportation problems under uncertain demands
- Robust solutions of uncertain linear programs
- Strong formulations of robust mixed 0-1 programming
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The robust network loading problem with dynamic routing
- Theory and applications of robust optimization
Cited in
(11)- Robust optimization for non-linear impact of data variation
- Robust location of new housing developments using a choice model
- A perfect information lower bound for robust lot-sizing problems
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Robust inventory theory with perishable products
- Dominance-based linear formulation for the anchor-robust project scheduling problem
- Robust and stochastic formulations for ambulance deployment and dispatch
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Robust flows with losses and improvability in evacuation planning
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Two-stage robust mixed integer programming problem with objective uncertainty
This page was built for publication: 2-stage robust MILP with continuous recourse variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449080)