Sciweavers

64
Voted
WEA
2005
Springer
90views Algorithms» more  WEA 2005»

A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables

15 years 8 months ago
A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables
Christian Liebchen
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where WEA
Authors Christian Liebchen
Comments (0)