Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
From MaRDI portal
Publication:337170
DOI10.1016/j.cor.2014.06.025zbMath1348.90262OpenAlexW2077832238MaRDI QIDQ337170
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.06.025
Sensitivity, stability, parametric optimization (90C31) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35)
Related Items (17)
Robust efficiency and well-posedness in uncertain vector optimization problems ⋮ On the recoverable robust traveling salesman problem ⋮ MIP-based approaches for robust storage loading problems with stacking constraints ⋮ On the \(p\)-hub interdiction problem ⋮ Characterization of norm-based robust solutions in vector optimization ⋮ Delay resistant line planning with a view towards passenger transfers ⋮ Minimizing recovery cost of network optimization problems ⋮ Unnamed Item ⋮ Robust location of new housing developments using a choice model ⋮ Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market ⋮ Optimal allocation of buffer times to increase train schedule robustness ⋮ A biobjective approach to recoverable robustness based on location planning ⋮ A survey on robustness in railway planning ⋮ A global tolerance approach to sensitivity analysis in linear programming ⋮ A stochastic dynamic programming approach for delay management of a single train line ⋮ Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts ⋮ 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
- Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
- Improving the modulo simplex algorithm for large-scale periodic timetabling
- Localization in single facility location
- Adjustable robust counterpart of conic quadratic problems
- Hull properties in location problems
- Robust discrete optimization and its applications
- Adjustable robust solutions of uncertain linear programs
- Project scheduling under uncertainty: survey and research potentials
- On the \(\epsilon\)-perturbation method for avoiding degeneracy
- Nominal and robust train timetabling problems
- Robust Convex Optimization
- An Empirical Analysis of Robustness Concepts for Timetabling
- Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations
- Dynamic Algorithms for Recoverable Robustness Problems.
- Introduction to Stochastic Programming
- Location Theory
- Recoverable Robust Timetables on Trees
- The Price of Robustness
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Recoverable Robustness in Shunting and Timetabling
- Light Robustness
- A Bicriteria Approach for Robust Timetabling
- A Mathematical Model for Periodic Scheduling Problems
- Robust Optimization for Empty Repositioning Problems
- Recoverable Robust Timetables: An Algorithmic Approach on Trees
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
