Delay Management Problem: Complexity Results and Robust Algorithms

DOI10.1007/978-3-540-85097-7_43zbMath1168.90344OpenAlexW1592331772MaRDI QIDQ5505683

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

Publication date: 27 January 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_43

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Engineering graph-based models for dynamic timetable information systems ⋮ A survey on robustness in railway planning ⋮ Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases

Cites Work

• 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
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Delay Management Problem: Complexity Results and Robust Algorithms