Recoverable robustness for train shunting problems
zbMATH Open1277.90060MaRDI QIDQ2867368FDOQ2867368
Authors: Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Daniele Frigioni 
Publication date: 11 December 2013
Published in: Algorithmic Operations Research (Search for Journal in Brave)
Full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/10471
Recommendations
- Recoverable Robustness in Shunting and Timetabling
- Robust algorithms and price of robustness in shunting problems
- Recoverable robustness for railway rolling stock planning
- The concept of recoverable robustness, linear programming recovery, and railway applications
- Dynamic algorithms for recoverable robustness problems
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Cited In (8)
- Recoverable robustness for railway rolling stock planning
- Robust algorithms and price of robustness in shunting problems
- Recoverable Robustness in Shunting and Timetabling
- On the online track assignment problem
- How to measure the robustness of shunting plans
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
- Robust algorithms for sorting railway cars
This page was built for publication: Recoverable robustness for train shunting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867368)
