E. K. Baker, Technical Note???An Exact Algorithm for the Time-Constrained Traveling Salesman Problem, Operations Research, vol.31, issue.5, pp.938-945, 1983.
DOI : 10.1287/opre.31.5.938

T. Cazenave, Nested Monte-Carlo search, IJCAI, pp.456-461, 2009.
DOI : 10.1109/ipdps.2009.5161122

URL : https://hal.archives-ouvertes.fr/hal-01436286

T. Cazenave and F. Teytaud, Application of the nested rollout policy adaptation algorithm to the traveling salesman problem with time windows', in LION 6, 2012.

N. Christofides, A. Mingozzi, and P. Toth, State-space relaxation procedures for the computation of bounds to routing problems', Networks, pp.145-164, 1981.

Y. Dumas, J. Desrosiers, E. Gelinas, and M. M. Solomon, An Optimal Algorithm for the Traveling Salesman Problem with Time Windows, Operations Research, vol.43, issue.2, pp.367-371, 1995.
DOI : 10.1287/opre.43.2.367

F. Focacci, A. Lodi, and M. Milano, A Hybrid Exact Algorithm for the TSPTW, INFORMS Journal on Computing, vol.14, issue.4, pp.403-417, 2002.
DOI : 10.1287/ijoc.14.4.403.2827

M. Gendreau, A. Hertz, G. Laporte, and M. Stan, A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows, Operations Research, vol.46, issue.3, pp.330-335, 1998.
DOI : 10.1287/opre.46.3.330

D. S. Johnson and C. H. Papadimitriou, Computational complexity and the traveling salesman problem, Mass. Inst. of Technology Laboratory for Computer Science, 1981.

M. López-ibáñez and C. Blum, Beam-ACO for the travelling salesman problem with time windows, Computers & Operations Research, vol.37, issue.9, pp.1570-1583, 2010.
DOI : 10.1016/j.cor.2009.11.015

G. Pesant, M. Gendreau, J. Y. Potvin, and J. M. Rousseau, An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows, Transportation Science, vol.32, issue.1, pp.12-29, 1998.
DOI : 10.1287/trsc.32.1.12

J. Y. Potvin and S. Bengio, The Vehicle Routing Problem with Time Windows Part II: Genetic Search, INFORMS Journal on Computing, vol.8, issue.2, p.165, 1996.
DOI : 10.1287/ijoc.8.2.165

A. Rimmel, F. Teytaud, and T. Cazenave, Optimization of the nested monte-carlo algorithm on the traveling salesman problem with time windows', Applications of Evolutionary Computation, pp.501-510, 2011.

C. D. Rosin, Nested rollout policy adaptation for monte carlo tree search, IJ- CAI, pp.649-654, 2011.

M. M. Solomon, Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, vol.35, issue.2, pp.254-265, 1987.
DOI : 10.1287/opre.35.2.254