Recoverable Robust Timetables on Trees

DOI10.1007/978-3-642-02026-1_43MaRDI QIDQ3637092zbMATH OpenOpenAlexFDO

Authors Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Cristina M. Pinotti

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_43

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Evaluation of recoverable-robust timetables on tree networks
• Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
• Dynamic algorithms for recoverable robustness problems
• Delay Management Problem: Complexity Results and Robust Algorithms
• Recoverable Robustness in Shunting and Timetabling

Cited in

(11)

• Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
• Delay-robust event scheduling
• Dynamic algorithms for recoverable robustness problems
• Extending concepts of reliability. Network creation games, real-time scheduling, and robust optimization
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
• Recoverable Robustness in Shunting and Timetabling
• Evaluation of recoverable-robust timetables on tree networks
• Recoverable robust timetable information
• Delay Management Problem: Complexity Results and Robust Algorithms
• Recoverable robust periodic timetabling

This page was built for publication: Recoverable Robust Timetables on Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637092)