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.025zbMATH Open1348.90262OpenAlexW2077832238MaRDI QIDQ337170FDOQ337170
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
Deterministic scheduling theory in operations research (90B35) Stochastic programming (90C15) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- A Mathematical Model for Periodic Scheduling Problems
- Nominal and robust train timetabling problems
- Title not available (Why is that?)
- The Price of Robustness
- Robust discrete optimization and its applications
- Introduction to Stochastic Programming
- Location Theory
- Light Robustness
- Title not available (Why is that?)
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Robust convex optimization
- Project scheduling under uncertainty: survey and research potentials
- Adjustable robust solutions of uncertain linear programs
- Robust Optimization for Empty Repositioning Problems
- An empirical analysis of robustness concepts for timetabling
- Title not available (Why is that?)
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Recoverable Robustness in Shunting and Timetabling
- A Bicriteria Approach for Robust Timetabling
- Hull properties in location problems
- On the \(\epsilon\)-perturbation method for avoiding degeneracy
- Recoverable robustness for train shunting problems
- Solving periodic timetable optimisation problems by modulo simplex calculations
- Dynamic algorithms for recoverable robustness problems
- Title not available (Why is that?)
- Recoverable Robust Timetables on Trees
- Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
- Improving the modulo simplex algorithm for large-scale periodic timetabling
- Recoverable Robust Timetables: An Algorithmic Approach on Trees
- Localization in single facility location
- Adjustable robust counterpart of conic quadratic problems
Cited In (18)
- Robust efficiency and well-posedness in uncertain vector optimization problems
- 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
- Recoverable Robustness in Shunting and Timetabling
- A biobjective approach to recoverable robustness based on location planning
- Optimal allocation of buffer times to increase train schedule robustness
- A stochastic dynamic programming approach for delay management of a single train line
- Minimizing recovery cost of network optimization problems
- MIP-based approaches for robust storage loading problems with stacking constraints
- Characterization of norm-based robust solutions in vector optimization
- On the recoverable robust traveling salesman problem
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- A global tolerance approach to sensitivity analysis in linear programming
- Delay resistant line planning with a view towards passenger transfers
- Approximate cutting plane approaches for exact solutions to robust optimization problems
- A survey on robustness in railway planning
- On the \(p\)-hub interdiction problem
- Title not available (Why is that?)
Uses Software
This page was built for publication: Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337170)
