Recoverable Robustness in Shunting and Timetabling

DOI10.1007/978-3-642-05465-5_2zbMath1266.90036MaRDI QIDQ3649158

Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel, Gianlorenzo D'Angelo, Alfredo Navarra, Serafino Cicerone, Daniele Frigioni

Publication date: 3 December 2009

Published in: Robust and Online Large-Scale Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-05465-5_2

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90B35: Deterministic scheduling theory in operations research

Related Items

Unnamed Item, Decomposition approaches for recoverable robust optimization problems, Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling, Line planning in public transportation: models and methods, Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances, Generalized light robustness and the trade-off between robustness and nominal quality, Recoverable robust knapsacks: the discrete scenario case, On strategic multistage operational two-stage stochastic 0--1 optimization for the rapid transit network design problem, Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem, Engineering graph-based models for dynamic timetable information systems, A biobjective approach to recoverable robustness based on location planning, Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem, Online knapsack of unknown capacity. How to optimize energy consumption in smartphones, Delay-Robust Event Scheduling, ROPI—a robust optimization programming interface for C++