1. Cooke, K.L., andE. Halsey: The Shortest Route Through a Network with Time-Dependent Internodal Transit Times. J. Math. Anal. and Appl.14, 1966, 493–498.
2. Dreyfus, S.E.: An Appraisal of Some Shortest-Path Algorithms. Opns. Res.17, 1969, 395–412.
3. Halpern, J., andI. Priess: Shortest Path with Time Constraints on Movement and Parking. O.R. and Statistics Mimeograph Series No. 125, Faculty of Industrial and Management Eng., Technion, Israel 1973.
4. Priess, I.: Shortest Path Problem in a Network with Restrictions on Movement and Parking. M.Sc. Thesis, Technion, Israel, (in Hebrew), 1973.
5. Szpigel, B.: Optimal Train Scheduling on a Single Track Railway. OR-72, Proceedings of the Sixth IFORS Conference on O.R., edited by M. Ross, 1973.