1. Ascheuer, N., Fischetti, M. and Grötschel, M., A polyhedral study of the asymmetric traveling salesman problem with time windows, Networks, Vol.36, No.2 (2000), pp.69–79.
2. Bock, A., Grant, E., Könemann, J. and Sanità, L., The school bus problem on trees, Algorithmica, Vol.67, No.1 (2013), pp.49–64.
3. Borndörfer, R., Grötschel, M., Klostermeier, F. and Küttner, C., Telebus Berlin: Vehicle scheduling in a dial-a-ride system, Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems book series, Vol.471 (1999), pp.391–422.
4. Bronshtein, E. M., Vagapova, D. M. and Nazmutdinova, A. V., On constructing a family of student delivery routes in minimal time, Automation and Remote Control, Vol.75, No.7 (2014), pp.1195–1202.
5. Brucker, P., Drexl, A., Möhring, R., Neumann, K., and Pesch, E., Resource-constrained project scheduling: Notation, classification, models, and methods, European Journal of Operational Research, Vol.112, No.1 (1999), pp.3–41.