Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Michael R. Bussieck, Thomas Winter, and Uwe Zimmermann. Discrete optimization in public rail transport. Mathematical Programming B, 79:415–444, 1997.
2. Ramesh Hariharan, Telikepalli Kavitha, and Kurt Mehlhorn. A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. In Michele Bugliesi et al., editors, ICALP, volume 4051 of Lecture Notes in Computer Science, pages 250–261. Springer, 2006.
3. Reinhard Huschke. Schneller Umsteigen. Berliner Zeitung, 61(262):12, 2005. Wednesday, November 9, 2005, In German.
4. Christian Liebchen. Finding short integral cycle bases for cyclic timetabling. In Giuseppe Di Battista and Uri Zwick, editors, ESA, volume 2832 of Lecture Notes in Computer Science, pages 715–726. Springer, 2003.
5. Christian Liebchen. A cut-based heuristic to produce almost feasible periodic railway timetables. In Sotiris E. Nikoletseas, editor, WEA, volume 3503 of Lecture Notes in Computer Science, pages 354–366. Springer, 2005.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献