The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems
From MaRDI portal
Publication:5084655
DOI10.1287/IJOC.2020.1042OpenAlexW3162745832MaRDI QIDQ5084655FDOQ5084655
Authors: Erick Delage, Ahmed Saif 
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1042
Recommendations
- A review on distributionally robust chance constrained optimization problems
- Distributionally robust possibilistic optimization problems
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints
- The distributionally robust optimization reformulation for stochastic complementarity problems
- Distributionally robust optimization. A review on theory and applications
- A distributional interpretation of robust optimization
- Distributionally robust optimization and its tractable approximations
- Distributionally robust mixed integer linear programs: persistency models with applications
- Frameworks and results in distributionally robust optimization
- Distributionally robust stochastic programming
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- A Linear Programming Approach to the Cutting-Stock Problem
- Risk, ambiguity and the Savage axioms
- On the power of randomization in on-line algorithms
- Convex measures of risk and trading constraints
- On duality theory of conic linear problems.
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- On the rate of convergence in Wasserstein distance of the empirical measure
- Adjustable robust solutions of uncertain linear programs
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Title not available (Why is that?)
- Interdicting a Nuclear-Weapons Project
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- A Definition of Uncertainty Aversion
- Data-driven risk-averse stochastic optimization with Wasserstein metric
- Distributionally Robust Convex Optimization
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
- Randomized minmax regret for combinatorial optimization under uncertainty
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- Duality in two-stage adaptive linear optimization: faster computation and stronger bounds
- Data-driven distributionally robust capacitated facility location problem
- Robust defibrillator deployment under cardiac arrest location uncertainty via row-and-column generation
Cited In (6)
- Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times
- Distributionally robust mixed integer linear programs: persistency models with applications
- Robust optimization for spread quality and shortfall in guaranteed targeted display advertising planning
- The Value of Randomized Strategies in Distributionally Robust Risk-Averse Network Interdiction Problems
- On the multistage shortest path problem under distributional uncertainty
- Frameworks and results in distributionally robust optimization
This page was built for publication: The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084655)
