1. J. Desrosier, Y. Dumas, M.M. Solomon, and F. Soumis, “Time constraint routing and scheduling,” in Handbooks in Operations Research and Management Science, Vol. 8, Network Routing, edited by M.O. Ball, T/L Magnanti, C.L Monma, G.L. Nemhauser (eds.). Elsevier Science Publishers: Amsterdam, pp. 35–139, 1995.
2. J.F. Cordeau, G. Desaulniers, J. Desrosiers, M.M. Solomon, and F. Soumis, “The VRP with time windows,” to appear in the Vehicle Routing Problem, Chapter 7, edited by P. Toth and D. Vigo, SIAM Monographs on Discrete Mathematics and Applications, 2001.
3. O. Braysy and M. Gendreau, “Vehicle routing problem with time windows, Part 1: Route construction and local search algorithms,” SINTEF Applied Mathematics Report, Department of Optimization, Norway, 2001.
4. O. Braysy and M. Gendreau, “Vehicle routing problem with time windows, Part II: Metaheuristics,” SINTEF Applied Mathematics Report, Department of Optimization, Norway, 2001.
5. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to The Theory of NP-Completeness, W. H. Freeman and Company, 1979.