Almost robust discrete optimization

DOI10.1016/J.EJOR.2019.01.043MaRDI QIDQ666949zbMATH OpenOpenAlexWikidataFDO

Authors Opher Baron, Oded Berman, Mohammad M. Fazel-Zarandi, Vahid Roshanaei

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

zbMATH Keywords

combinatorial optimizationdecompositiondecision making under uncertaintybinary variablesalmost robust optimizationrobust/stochastic discrete optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Stochastic programming (90C15) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• The Price of Robustness
• scientific article; zbMATH DE number 764410
• Approximate robust optimization for the connected facility location problem

Cites work

• scientific article; zbMATH DE number 3922379 (Why is no real title available?)
• scientific article; zbMATH DE number 2121076 (Why is no real title available?)
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A soft robust model for optimization under ambiguity
• Chance-constrained programming
• Constructing Risk Measures from Uncertainty Sets
• Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
• Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
• Goal-driven optimization
• Infinitely constrained optimization problems
• Integrated chance constraints: reduced forms and an algorithm
• Logic-based Benders decomposition
• On robust optimization of two-stage systems
• On the complexity of a class of combinatorial optimization problems with uncertainty
• Optimal Inequalities in Probability Theory: A Convex Optimization Approach
• Partitioning procedures for solving mixed-variables programming problems
• Production planning via scenario modelling
• Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
• Robust Mean-Covariance Solutions for Stochastic Optimization
• Robust Optimization of Large-Scale Systems
• Robust convex optimization
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Robust optimization
• Robust scenario optimization based on downside-risk measure for multi-period portfolio selection
• 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 integer \(L\)-shaped method for stochastic integer programs with complete recourse

Cited in

(2)

• Approximate robust optimization for the connected facility location problem
• Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut

This page was built for publication: Almost robust discrete optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666949)