Approximate cutting plane approaches for exact solutions to robust optimization problems

DOI10.1016/j.ejor.2019.11.059zbMath1436.90095OpenAlexW2991299450MaRDI QIDQ2301927

Julius Pätzold, Anita Schöbel

Publication date: 25 February 2020

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.11.059

zbMATH Keywords

mixed integer programmingrobust optimizationrobustness and sensitivity analysiscutting-plane methods

Mathematics Subject Classification ID

Mixed integer programming (90C11) Robustness in mathematical programming (90C17)

Cites Work

• Unnamed Item
• On exact solutions for the minmax regret spanning tree problem
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• Generalized light robustness and the trade-off between robustness and nominal quality
• Robust load planning of trains in intermodal transportation
• Improving the modulo simplex algorithm for large-scale periodic timetabling
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Some outer approximation methods for semi-infinite optimization problems
• Robust discrete optimization and its applications
• Robust solutions of linear programming problems contaminated with uncertain data
• Dominance for multi-objective robust optimization concepts
• Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
• A biobjective approach to recoverable robustness based on location planning
• A survey on robustness in railway planning
• Uncertain convex programs: randomized solutions and confidence levels
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
• A Benders decomposition approach for the robust spanning tree problem with interval data
• Robust Convex Optimization
• An Empirical Analysis of Robustness Concepts for Timetabling
• A Polyhedral Approximation Framework for Convex and Robust Distributed Optimization
• Random Convex Programs
• The Cutting-Plane Method for Solving Convex Programs
• The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
• Cutting-set methods for robust convex optimization with pessimizing oracles
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Robust Solutions to Least-Squares Problems with Uncertain Data
• A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Approximate cutting plane approaches for exact solutions to robust optimization problems