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

Christian Liebchen. A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables. In Sotiris E. Nikoletseas, editor, Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings. Volume 3503 of Lecture Notes in Computer Science, pages 354-366, Springer, 2005. [doi]

Abstract

Abstract is missing.