The train marshalling problem

Discrete Applied Mathematics

Volumn 103, Issue 1-3, 2000, Pages 41-54

  Dahlhaus, Elias ^a   Horak, Peter ^b   Miller, Mirka ^c   Ryan, Joseph F ^c  

^a UNIVERSITY OF COLOGNE   (Germany)

^b KUWAIT UNIVERSITY   (Kuwait)

^c UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

NP completeness; Numerical matching with target sums; Partitions; Train rearrangement

Indexed keywords

EID: 0346042983     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00219-X     Document Type: Article

References (5)

1. P. Berlioux, P. Bizard, Algorithms 2, Wiley, New York, 1990.
2. Ganley J.L., Cohoon J.P. Minimum-congestion hypergraph embedding in a cycle, IEEE Trans. Computers. 46(5):1997;600-602.
3. M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Friedman, New York, 1979.
4. D. Knuth, personal letter.
5. Zhu Y., Zhu R. Sequence reconstruction under some order-type constraints, Scientia Sinica Series A. 26(7):1983;702-713.