A biobjective approach to recoverable robustness based on location planning
From MaRDI portal
Publication:1753588
DOI10.1016/j.ejor.2017.02.014zbMath1403.90599arXiv1604.01542OpenAlexW2588152482MaRDI QIDQ1753588
Marc Goerigk, Anita Schöbel, Emilio Carrizosa
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.01542
Multi-objective and goal programming (90C29) Stochastic programming (90C15) Discrete location and assignment (90B80)
Related Items (3)
Robustness in nonsmooth nonconvex optimization problems ⋮ On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential ⋮ Approximate cutting plane approaches for exact solutions to robust optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minmax robustness for multi-objective optimization problems
- 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
- Recoverable robust knapsacks: the discrete scenario case
- On the effectiveness of scenario generation techniques in single-period portfolio optimization
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
- Robust discrete optimization and its applications
- Generalized goal programming: polynomial methods and applications
- Adjustable robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Project scheduling under uncertainty: survey and research potentials
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Minisum location with closest Euclidean distances
- DC programming: overview.
- Robust recoverable and two-stage selection problems
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- Optimization theory and methods. Nonlinear programming
- Delay-Robust Event Scheduling
- An Empirical Analysis of Robustness Concepts for Timetabling
- A Scenario-Based Approach for Robust Linear Optimization
- Recoverable Robustness by Column Generation
- Locating Objects in the Plane Using Global Optimization Techniques
- The Weighted Euclidean 1-Center Problem
- Portfolio Optimization and Performance Analysis
- The Price of Robustness
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Recoverable Robustness in Shunting and Timetabling
- Light Robustness
- Using Block Norms for Location Modeling
- Robust Optimization for Empty Repositioning Problems
- The Location of Emergency Service Facilities
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- An Approach to Location Models Involving Sets as Existing Facilities
- Gauge distances and median hyperplanes
- Locating facilities by minimax relative to closest points of demand areas
This page was built for publication: A biobjective approach to recoverable robustness based on location planning
