Routing trains through railway stations: complexity issues
Authors:
- Leo G. KroonLKLeo G. Kroon
- H. Edwin RomeijnHRH. Edwin Romeijn
- Peter J. ZwaneveldPZPeter J. Zwaneveld
- 1 May 1997
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 98 (3) , 485-498
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- An analysis of shift class design problemsEuropean Journal of Operational Research, 1994
- A model and strategy for train pathing with choice of lines, platforms, and routesTransportation Research Part B: Methodological, 1994
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed timesEuropean Journal of Operational Research, 1993
- On the computational complexity of (maximum) shift class schedulingEuropean Journal of Operational Research, 1993
- License class design: complexity and algorithmsEuropean Journal of Operational Research, 1992
- On the computational complexity of (maximum) class schedulingEuropean Journal of Operational Research, 1991
- Scheduling jobs with fixed start and end timesDiscrete Applied Mathematics, 1987
- On the facial structure of set packing polyhedraMathematical Programming, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972