On the Complexity of Train Assignment Problems

[1]  Peter Brucker,et al.  Routing of Railway Carriages , 2003, J. Glob. Optim..

[2]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem , 2001 .

[3]  L. Trevisan,et al.  On Approximation Scheme Preserving Reducibility and Its Applications , 2000, Theory of Computing Systems.

[4]  A. Löbel.  Optimale Vehicle Scheduling in Public Transit , 1997 .

[5]  Michael R. Bussieck,et al.  Discrete optimization in public rail transport , 1997, Math. Program..

[6]  Viggo Kann,et al.  Hardness of Approximating Problems on Cubic Graphs , 1997, CIAC.

[7]  Luca Trevisan,et al.  On Approximation Scheme Preserving Reducability and Its Applications , 1994, FSTTCS.

[8]  Lex Schrijver,et al.  Minimum circulation of railway stock , 1993 .

[9]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[10]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[11]  Celso C. Ribeiro,et al.  A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem , 1991, Oper. Res..

[12]  Peter Brucker,et al.  Routing of railway carriages: A case study , 1999 .

[13]  Albert P. M. Wagelmans,et al.  Models and Algorithms for Vehicle Scheduling , 1995 .

[14]  Jacques Desrosiers,et al.  Chapter 2 Time constrained routing and scheduling , 1995 .

[15]  Alan A. Bertossi,et al.  On some matching problems arising in vehicle scheduling models , 1987, Networks.

[16]  D. R. Fulkerson,et al.  Notes on Linear Programming: Part XV Minimizing the Number of Carriers to Meet a Fixed Schedule , 1954 .