Railway delay management: Exploring its algorithmic complexity

DOI10.1007/978-3-540-27810-8_18MaRDI QIDQ5315372zbMATH OpenOpenAlexFDO

Authors Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98413, http://hdl.handle.net/20.500.11850/69769

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06) Management decision making, including multiple objectives (90B50) Programming involving graphs or networks (90C35)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• Delay management with re-routing of passengers
• Delay Management Problem: Complexity Results and Robust Algorithms
• IP-based techniques for delay management with priority decisions
• A note on the online nature of the railway delay management problem

Cited in

(14)

• Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
• Computing delay resistant railway timetables
• Railway delay management with passenger rerouting considering train capacity constraints
• Optimization models for the single delay management problem in public transportation
• Delay management including capacities of stations
• Delay management with re-routing of passengers
• IP-based techniques for delay management with priority decisions
• A note on the online nature of the railway delay management problem
• Online train disposition: to wait or not to wait?
• Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
• Delay Management Problem: Complexity Results and Robust Algorithms
• Graph-Theoretic Concepts in Computer Science
• Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization
• A stochastic dynamic programming approach for delay management of a single train line

This page was built for publication: Railway delay management: Exploring its algorithmic complexity

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