The train marshalling problem

• 1 July 2000
• journal article
• Published by Elsevier in Discrete Applied Mathematics
• Vol. 103  (1-3) , 41-54
• https://doi.org/10.1016/s0166-218x(99)00219-x

Abstract

Keywords

• PARTITIONS
• NP-COMPLETENESS
• TRAIN REARRANGEMENT
• NUMERICAL MATCHING WITH TARGET SUMS
• NP COMPLETENESS