Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
From MaRDI portal
Publication:1750469
DOI10.1016/j.ejor.2018.01.056zbMath1388.90100arXiv1610.05127OpenAlexW2535619235MaRDI QIDQ1750469
Marc Goerigk, André B. Chassein
Publication date: 22 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.05127
robustness and sensitivity analysismin-max regretrobust combinatorial optimizationvariable-sized uncertainty
Related Items
Mixed uncertainty sets for robust combinatorial optimization, Variable-sized uncertainty and inverse problems in robust optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A variational approach to define robustness for parametric multiobjective optimization problems
- On the approximability of robust spanning tree problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Variable-sized uncertainty and inverse problems in robust optimization
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Data-driven robust optimization
- Interval data minmax regret network optimization problems
- Robust optimization-methodology and applications
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Recent advances in robust optimization: an overview
- Robustness analysis in decision aiding, optimization, and analytics
- Robust Convex Optimization
- Distributionally Robust Convex Optimization
- Distributionally Robust Optimization and Its Tractable Approximations
- Constructing Uncertainty Sets for Robust Linear Optimization
- Theory and Applications of Robust Optimization
- Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty
- The robust spanning tree problem with interval data
