Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases

DOI10.1007/s10878-009-9247-4zbMath1176.90203OpenAlexW2021221063MaRDI QIDQ1041435

Serafino Cicerone, Daniele Frigioni, Alfredo Navarra, Gianlorenzo D'Angelo, Gabriele Di Stefano

Publication date: 2 December 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9247-4

zbMATH Keywords

robust optimizationrecoverable robustnesstimetable optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Multimode time-cost-robustness trade-off project scheduling problem under uncertainty ⋮ Unnamed Item ⋮ Nominal and robust train timetabling problems ⋮ Engineering graph-based models for dynamic timetable information systems ⋮ Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances ⋮ Optimal allocation of buffer times to increase train schedule robustness ⋮ A biobjective approach to recoverable robustness based on location planning ⋮ A survey on robustness in railway planning

Cites Work

• Unnamed Item
• Unnamed Item
• Robust optimization - a comprehensive survey
• Optimization models for the single delay management problem in public transportation
• The Price of Robustness
• Algorithm Theory - SWAT 2004
• Delay Management Problem: Complexity Results and Robust Algorithms
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases