Algorithm Theory - SWAT 2004
From MaRDI portal
Publication:5315372
DOI10.1007/b98413zbMath1095.68595OpenAlexW2615963353MaRDI QIDQ5315372
Björn Glaus, Michael Gatto, 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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization, Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances, Optimization models for the single delay management problem in public transportation, Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases, Computing delay resistant railway timetables, Delay Management Problem: Complexity Results and Robust Algorithms
