Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
From MaRDI portal
Publication:5085995
Recommendations
- A Lagrangian dual method for two-stage robust optimization with binary uncertainties
- A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
- A converging Benders' decomposition algorithm for two-stage mixed-integer recourse models
- Saddle point approximation approaches for two-stage robust optimization problems
Cites work
- A Linear Decision-Based Approximation Approach to Stochastic Programming
- Adjustable robust optimization via Fourier-Motzkin elimination
- Adjustable robust solutions of uncertain linear programs
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Binary decision rules for multistage adaptive mixed-integer optimization
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Design of near optimal decision rules in multistage adaptive mixed-integer optimization
- 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 decision rule approximations for stochastic programming via liftings
- Min-max-min robust combinatorial optimization
- Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set
- Multistage robust mixed-integer optimization with adaptive partitions
- Oracle-based algorithms for binary two-stage robust optimization
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Primal and dual linear decision rules in stochastic and robust optimization
- Principles and practice of constraint programming. 2nd international workshop, PPCP '94, Rosario, Orcas Island, Washington, DC, USA, May 2-4, 1994. Proceedings
- Recent advances in robust optimization: an overview
- Robust optimization
- Theory and applications of robust optimization
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- Two-stage network constrained robust unit commitment problem
- Uncertain linear programs: extended affinely adjustable robust counterparts
- Where are the hard knapsack problems?
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- \(K\)-adaptability in two-stage robust binary programming
Cited in
(7)- A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization
- Adjustable robust optimization with objective uncertainty
- Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
- A Lagrangian dual method for two-stage robust optimization with binary uncertainties
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
This page was built for publication: Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085995)
