Data-driven prediction of relevant scenarios for robust combinatorial optimization
From MaRDI portal
Cites work
- K-adaptability in two-stage robust binary programming
- A Lagrangian dual method for two-stage robust optimization with binary uncertainties
- A survey of adjustable robust optimization
- Adjustable robust solutions of uncertain linear programs
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- An exact algorithm for the robust shortest path problem with interval data
- Computing robust basestock levels
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Data-driven robust optimization
- Data-driven robust optimization using deep neural networks
- Integer Programming Formulation of Traveling Salesman Problems
- Learning when to use a decomposition
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set
- Multistage robust mixed-integer optimization with adaptive partitions
- Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective
- Oracle-based algorithms for binary two-stage robust optimization
- Random sampling and machine learning to understand good decompositions
- Recent advances in robust optimization: an overview
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Robust convex optimization
- Robust discrete optimization and network flows
- Robust optimization
- Robust solutions of uncertain linear programs
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The robust shortest path problem with interval data via Benders decomposition
- Theory and applications of robust optimization
- Uncertain convex programs: randomized solutions and confidence levels
Cited in
(2)
This page was built for publication: Data-driven prediction of relevant scenarios for robust combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6975864)
