On the complexity of train assignment problems

DOI10.1007/3-540-45678-3_34MaRDI QIDQ4474107zbMATH OpenFDO

Authors Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, K. Steinhöfel, David Scot Taylor, Peter Widmayer

Publication date 4 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230390.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Traffic problems in operations research (90B20)

Recommendations

• Routing trains through railway stations: Complexity issues
• Modelling and solving a train path assignment model
• Waiting for trains: complexity results
• Algorithms and Computation
• Exact train pathing

Cited in

(16)

• Routing trains through railway stations: Complexity issues
• Scheduling trams in the morning
• The train marshalling problem
• Complexity, bounds and dynamic programming algorithms for single track train scheduling
• Nominal and robust train timetabling problems
• The problem of trains formation and scheduling: integer statements
• A Lagrangian heuristic for a train-unit assignment problem
• Track assignment
• Solving a real-world train-unit assignment problem
• The Train Delivery Problem Revisited
• Solving a real-world train unit assignment problem
• Optimal algorithms for train shunting and relaxed list update problems
• The train delivery problem -- vehicle routing meets bin packing
• Algorithms and Computation
• Online train shunting
• Waiting for trains: complexity results

This page was built for publication: On the complexity of train assignment problems

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