On the Complexity of Train Assignment Problems

T Erlebach; M Gantenbein; D Hürlimann; G Neyer; A Pagourtzis; P Penna; K Schlude; K Steinhofel; D.S Taylor; P Widmayer

On the Complexity of Train Assignment Problems

T Erlebach, M Gantenbein, D Hürlimann, G Neyer, A Pagourtzis, P Penna, K Schlude, K Steinhofel, D.S Taylor, P Widmayer

Informatics

Research output: Contribution to journal › Article › peer-review

12 Citations (Scopus)

Original language	English
Pages (from-to)	390 - 402
Number of pages	13
Journal	Lecture Notes in Computer Science
Volume	LNCS 2223
Publication status	Published - 2001

Cite this

@article{a0d072a578fb47f6bc9d3fa753a60ea6,

title = "On the Complexity of Train Assignment Problems",

author = "T Erlebach and M Gantenbein and D H{\"u}rlimann and G Neyer and A Pagourtzis and P Penna and K Schlude and K Steinhofel and D.S Taylor and P Widmayer",

year = "2001",

language = "English",

volume = "LNCS 2223",

pages = "390 -- 402",

journal = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - On the Complexity of Train Assignment Problems

AU - Erlebach, T

AU - Gantenbein, M

AU - Hürlimann, D

AU - Neyer, G

AU - Pagourtzis, A

AU - Penna, P

AU - Schlude, K

AU - Steinhofel, K

AU - Taylor, D.S

AU - Widmayer, P

PY - 2001

Y1 - 2001

M3 - Article

VL - LNCS 2223

SP - 390

EP - 402

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -