A note on ``Multistage methods for freight train classification

DOI10.1002/NET.21498MaRDI QIDQ5326808zbMATH OpenOpenAlexFDO

Authors Dirk Briskorn, Florian Jaehn

Publication date 6 August 2013

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21498

zbMATH Keywords

minimum feedback arc set problem on Euler multigraphsrailway optimizationshunting yardtrain classification

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Transportation, logistics and supply chain management (90B06)

Recommendations

• Multistage methods for freight train classification
• The hardness of train rearrangements
• Multistage methods for freight train classification
• Minimizing delays in a shunting yard
• The basic train makeup problem in shunting yards

Cited in

(5)

• Adapting exact and heuristic procedures in solving an NP-hard sequencing problem
• Multistage methods for freight train classification
• Multistage methods for freight train classification
• Robust algorithms for sorting railway cars
• Solving sorting of rolling stock problems utilizing pseudochain structures in graphs

This page was built for publication: A note on ``Multistage methods for freight train classification

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