Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
From MaRDI portal
(Redirected from Publication:337170)
Recommendations
- The concept of recoverable robustness, linear programming recovery, and railway applications
- Recoverable Robustness in Shunting and Timetabling
- Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
- Dynamic algorithms for recoverable robustness problems
- A bicriteria approach for robust timetabling
Cites work
- scientific article; zbMATH DE number 1803754 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- A Mathematical Model for Periodic Scheduling Problems
- A bicriteria approach for robust timetabling
- Adjustable robust counterpart of conic quadratic problems
- Adjustable robust solutions of uncertain linear programs
- An empirical analysis of robustness concepts for timetabling
- Dynamic algorithms for recoverable robustness problems
- Extending concepts of reliability. Network creation games, real-time scheduling, and robust optimization
- Hull properties in location problems
- Improving the modulo simplex algorithm for large-scale periodic timetabling
- Introduction to stochastic programming.
- Light robustness
- Localization in single facility location
- Location theory. A unified approach
- Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
- Nominal and robust train timetabling problems
- On the \(\epsilon\)-perturbation method for avoiding degeneracy
- Project scheduling under uncertainty: survey and research potentials
- Recoverable Robust Timetables on Trees
- Recoverable Robust Timetables: An Algorithmic Approach on Trees
- Recoverable Robustness in Shunting and Timetabling
- Recoverable robustness for train shunting problems
- Robust convex optimization
- Robust discrete optimization and its applications
- Robust optimization
- Robust optimization for empty repositioning problems
- Solving periodic timetable optimisation problems by modulo simplex calculations
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The concept of recoverable robustness, linear programming recovery, and railway applications
Cited in
(21)- Approximate cutting plane approaches for exact solutions to robust optimization problems
- On the \(p\)-hub interdiction problem
- Robust location of new housing developments using a choice model
- A biobjective approach to recoverable robustness based on location planning
- Characterization of norm-based robust solutions in vector optimization
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Delay resistant line planning with a view towards passenger transfers
- Delay-robust event scheduling
- MIP-based approaches for robust storage loading problems with stacking constraints
- A survey on robustness in railway planning
- Minimizing recovery cost of network optimization problems
- Robust efficiency and well-posedness in uncertain vector optimization problems
- A robust optimization approach for multi-objective linear programming under uncertainty
- A stochastic dynamic programming approach for delay management of a single train line
- Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
- Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market
- On the recoverable robust traveling salesman problem
- Recoverable Robustness in Shunting and Timetabling
- A global tolerance approach to sensitivity analysis in linear programming
- The concept of recoverable robustness, linear programming recovery, and railway applications
- Optimal allocation of buffer times to increase train schedule robustness
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)
