Modeling and Solving the Train Timetabling Problem
Top Cited Papers
- 1 October 2002
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 50 (5), 851-861
- https://doi.org/10.1287/opre.50.5.851.362
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A Heuristic Method for the Set Covering ProblemOperations Research, 1999
- Railway Timetabling Using Lagrangian RelaxationTransportation Science, 1998
- Heuristic Techniques for Single Line Train SchedulingJournal of Heuristics, 1997
- A Model, Algorithms and Strategy for Train PathingJournal of the Operational Research Society, 1995
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationshipsAnnals of Operations Research, 1994
- Optimal Solution of Vehicle Routing Problems Using Minimum K-TreesOperations Research, 1994
- Pricing of track time in railroad operations: An internal market approachTransportation Research Part B: Methodological, 1994
- A fast heuristic for the train scheduling problemComputers & Operations Research, 1994
- Geometric Algorithms and Combinatorial OptimizationAlgorithms and Combinatorics, 1988
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971