Waiting for trains: complexity results

DOI10.1007/978-3-030-39219-2_24MaRDI QIDQ779218zbMATH OpenOpenAlexFDO

Authors Bjoern Tauer, Dennis Fischer, Janosch Fuchs, Laura Vargas Koch, Stephan Zieger

Publication date 21 July 2020

Full work available at URL https://doi.org/10.1007/978-3-030-39219-2_24

zbMATH Keywords

packet routingparameterized complexitytrain schedulingwormhole routing

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Traffic problems in operations research (90B20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Routing trains through railway stations: Complexity issues
• Online train shunting
• Train scheduling on a unidirectional path
• Exact train pathing
• scientific article; zbMATH DE number 2081007

Cited in

(10)

• The hardness of train rearrangements
• The Merlin-Randell problem of train journeys
• Routing trains through railway stations: Complexity issues
• Scheduling trams in the morning
• scientific article; zbMATH DE number 3956436 (Why is no real title available?)
• scientific article; zbMATH DE number 2081007 (Why is no real title available?)
• Train scheduling on a unidirectional path
• Online train shunting
• Two exact algorithms for the packet scheduling problem
• Exact train pathing

This page was built for publication: Waiting for trains: complexity results

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