Almost robust discrete optimization
type: Item
instance of: scholarly article
title: Almost robust discrete optimization
zbMATH Open document ID: 1430.90428
author: Opher Baron
author: Oded Berman
author: Mohammad M. Fazel-Zarandi
author: Vahid Roshanaei
published in: European Journal of Operational Research
publication date: 2019-03-12T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7034938
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: decision making under uncertainty
zbMATH Keywords: robust/stochastic discrete optimization
zbMATH Keywords: decomposition
zbMATH Keywords: almost robust optimization
zbMATH Keywords: binary variables
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.01.043
OpenAlex ID: W2913171886
cites work: Strong formulations of robust mixed 0-1 programming
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: A Soft Robust Model for Optimization Under Ambiguity
cites work: Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
cites work: Q3182207
cites work: Robust convex optimization
cites work: Robust solutions of uncertain linear programs
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
cites work: Optimal Inequalities in Probability Theory: A Convex Optimization Approach
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: Infinitely constrained optimization problems
cites work: Chance-constrained programming
cites work: Goal-Driven Optimization
cites work: Production planning via scenario modelling
cites work: Integrated chance constraints: reduced forms and an algorithm
cites work: Logic-based Benders decomposition
cites work: Q3696868
cites work: Robust discrete optimization and its applications
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: Robust Optimization of Large-Scale Systems
cites work: Constructing Risk Measures from Uncertainty Sets
cites work: Robust scenario optimization based on downside-risk measure for multi-period portfolio selection
cites work: Robust Mean-Covariance Solutions for Stochastic Optimization
cites work: Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
cites work: Q4830009
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: On robust optimization of two-stage systems
Wikidata QID: Q128514118
DOI: 10.1016/J.EJOR.2019.01.043
description: scientific article; zbMATH DE number 7034938