A generalized approach for train marshalling

DOI10.1007/978-3-031-24907-5_49MaRDI QIDQ6606579zbMATH OpenFDO

Authors Elias Dahlhaus

Publication date 17 September 2024

zbMATH Keywords

dynamic programmingtrain marshallingPQ-tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Searching and sorting (68P10) Transportation, logistics and supply chain management (90B06)

Recommendations

• Solving sorting of rolling stock problems utilizing pseudochain structures in graphs
• Solving the train marshalling problem by inclusion-exclusion
• The train marshalling problem
• Complexity of a car sorting algorithm
• Multistage methods for freight train classification

Cites work

• Multistage methods for freight train classification
• Solving the train marshalling problem by inclusion-exclusion
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The train marshalling problem

This page was built for publication: A generalized approach for train marshalling

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