The train marshalling problem

DOI10.1016/S0166-218X(99)00219-XzbMath0962.90009MaRDI QIDQ1570821

Mirka Miller, Peter Horák, Elias Dahlhaus, Joseph F. Ryan

Publication date: 21 June 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

partitions; NP-completeness; numerical matching with target sums; train rearrangement

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C60: Abstract computational complexity for mathematical programming problems

05C65: Hypergraphs

90B20: Traffic problems in operations research

Cites Work

• Unnamed Item
• Unnamed Item