Leo G. Kroon

From MaRDI portal
Revision as of 17:50, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Leo G. Kroon to Leo G. Kroon: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:684342

Available identifiers

zbMath Open kroon.leo-gMaRDI QIDQ684342

List of research outcomes





PublicationDate of PublicationType
The optimal cost chromatic partition problem for trees and interval graphs2024-06-05Paper
Application of an iterative framework for real-time railway rescheduling2018-07-11Paper
Review of energy-efficient train control and timetabling2018-05-24Paper
The Travelers Route Choice Problem Under Uncertainty: Dominance Relations Between Strategies2017-06-02Paper
https://portal.mardi4nfdi.de/entity/Q28185872016-09-07Paper
Robust train routing and online re-scheduling2012-09-28Paper
Recoverable Robustness for Railway Rolling Stock Planning2012-09-28Paper
Rescheduling in passenger railways: The rolling stock rebalancing problem2010-07-24Paper
Disruption Management in Passenger Railway Transportation2009-12-03Paper
Operations Research in passenger railway transportation2008-01-24Paper
Circulation of railway rolling stock: a branch-and-price approach2007-10-10Paper
Maintenance routing for train units: the interchange model2006-12-07Paper
A rolling stock circulation model for combining and splitting of passenger trains2006-09-13Paper
Reliability and heterogeneity of railway services2006-04-28Paper
On solving multi-type railway line planning problems2005-10-17Paper
https://portal.mardi4nfdi.de/entity/Q27599212002-08-07Paper
Routing trains through a railway station based on a node packing model2002-04-11Paper
https://portal.mardi4nfdi.de/entity/Q27599142001-12-18Paper
Quasicomplete factorization and the two machine flow shop problem1999-12-19Paper
Variants of the two machine flow shop problem connected with factorization of matrix functions1999-02-22Paper
Routing trains through railway stations: Complexity issues1999-02-22Paper
Exact and approximation algorithms for the operational fixed interval scheduling problem1998-06-11Paper
Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem1998-06-02Paper
Routing Trains Through Railway Stations: Model Formulation and Algorithms1997-12-14Paper
Factorization and job scheduling: A connection via companion based matrix functions1997-05-28Paper
Companion based matrix functions: Description and minimal factorization1997-05-25Paper
https://portal.mardi4nfdi.de/entity/Q48363061995-12-13Paper
An analysis of shift class design problems1995-05-30Paper
On the computational complexity of (maximum) shift class scheduling1993-09-15Paper
License class design: Complexity and algorithms1993-04-01Paper
On the computational complexity of (maximum) class scheduling1992-06-26Paper
Some Extensions of the Discrete Lotsizing and Scheduling Problem1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39720531992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q52028181990-01-01Paper
Addenda and errata: An indicator for Wiener-Hopf integral equations with invertible analytic symbol1983-01-01Paper
An indicator for Wiener-Hopf integral equations with invertible analytic symbol1983-01-01Paper

Research outcomes over time

This page was built for person: Leo G. Kroon