The hardness of train rearrangements

DOI10.1016/j.orl.2008.12.005zbMath1159.90402OpenAlexW2130624410MaRDI QIDQ1015300

Maciej Modelski, Cor A. J. Hurkens, Christian E. J. Eggermont, Gerhard J. Woeginger

Publication date: 7 May 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.12.005

zbMATH Keywords

computational complexityplanningrailway optimizationshunting

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Scheduling trams in the morning
• Real-time dispatch of trams in storage yards
• NP completeness of the edge precoloring extension problem on bipartite graphs

This page was built for publication: The hardness of train rearrangements