Almost robust discrete optimization
Publication:666949
DOI10.1016/J.EJOR.2019.01.043zbMath1430.90428OpenAlexW2913171886WikidataQ128514118 ScholiaQ128514118MaRDI QIDQ666949
Mohammad M. Fazel-Zarandi, Vahid Roshanaei, Opher Baron, Oded Berman
Publication date: 12 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.01.043
decompositioncombinatorial optimizationdecision making under uncertaintybinary variablesalmost robust optimizationrobust/stochastic discrete optimization
Mixed integer programming (90C11) Stochastic programming (90C15) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Integrated chance constraints: reduced forms and an algorithm
- Partitioning procedures for solving mixed-variables programming problems
- Infinitely constrained optimization problems
- Robust solutions of uncertain linear programs
- Production planning via scenario modelling
- Robust discrete optimization and its applications
- Logic-based Benders decomposition
- Robust discrete optimization and network flows
- On robust optimization of two-stage systems
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Robust scenario optimization based on downside-risk measure for multi-period portfolio selection
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- Strong formulations of robust mixed 0-1 programming
- Robust Convex Optimization
- Chance-Constrained Programming
- A Soft Robust Model for Optimization Under Ambiguity
- Constructing Risk Measures from Uncertainty Sets
- Robust Mean-Covariance Solutions for Stochastic Optimization
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- The Price of Robustness
- Robust Optimization of Large-Scale Systems
- Goal-Driven Optimization
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- On the complexity of a class of combinatorial optimization problems with uncertainty
This page was built for publication: Almost robust discrete optimization
