The following pages link to Leo G. Kroon (Q684342):
Displaying 37 items.
- On the computational complexity of (maximum) shift class scheduling (Q684343) (← links)
- (Q856689) (redirect page) (← links)
- Maintenance routing for train units: the interchange model (Q856690) (← links)
- Rescheduling in passenger railways: The rolling stock rebalancing problem (Q983628) (← links)
- (Q1055657) (redirect page) (← links)
- Addenda and errata: An indicator for Wiener-Hopf integral equations with invertible analytic symbol (Q1055658) (← links)
- On the computational complexity of (maximum) class scheduling (Q1179005) (← links)
- License class design: Complexity and algorithms (Q1207538) (← links)
- Variants of the two machine flow shop problem connected with factorization of matrix functions (Q1278197) (← links)
- Routing trains through railway stations: Complexity issues (Q1278725) (← links)
- Quasicomplete factorization and the two machine flow shop problem (Q1307290) (← links)
- An analysis of shift class design problems (Q1342640) (← links)
- Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883) (← links)
- Routing trains through a railway station based on a node packing model (Q1592731) (← links)
- Application of an iterative framework for real-time railway rescheduling (Q1652076) (← links)
- Review of energy-efficient train control and timetabling (Q1752813) (← links)
- An indicator for Wiener-Hopf integral equations with invertible analytic symbol (Q1837364) (← links)
- Circulation of railway rolling stock: a branch-and-price approach (Q2384905) (← links)
- Reliability and heterogeneity of railway services (Q2490180) (← links)
- A rolling stock circulation model for combining and splitting of passenger trains (Q2503094) (← links)
- Companion based matrix functions: Description and minimal factorization (Q2564920) (← links)
- Factorization and job scheduling: A connection via companion based matrix functions (Q2564926) (← links)
- On solving multi-type railway line planning problems (Q2569037) (← links)
- (Q2759914) (← links)
- (Q2759921) (← links)
- (Q2818587) (← links)
- Robust train routing and online re-scheduling (Q2917284) (← links)
- Recoverable Robustness for Railway Rolling Stock Planning (Q2917356) (← links)
- Disruption Management in Passenger Railway Transportation (Q3649179) (← links)
- (Q3972053) (← links)
- Some Extensions of the Discrete Lotsizing and Scheduling Problem (Q3982669) (← links)
- Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem (Q4363763) (← links)
- Routing Trains Through Railway Stations: Model Formulation and Algorithms (Q4364995) (← links)
- (Q4836306) (← links)
- (Q5202818) (← links)
- Operations Research in passenger railway transportation (Q5438545) (← links)
- The Travelers Route Choice Problem Under Uncertainty: Dominance Relations Between Strategies (Q5739121) (← links)