H. Abeledo, R. A. Fukasawa, E. Pessoa, and . Uchoa, The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm, Lecture Notes in Computer Science, vol.6049, pp.202-213, 2010.
DOI : 10.1007/978-3-642-13193-6_18

L. Bianco, A. Mingozzi, and S. Ricciardelli, The traveling salesman problem with cumulative costs, Networks, vol.26, issue.2, pp.81-91, 1993.
DOI : 10.1002/net.3230230202

L. Bigras, M. Gamache, and G. Savard, The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times, Discrete Optimization, vol.5, issue.4, pp.685-699, 2008.
DOI : 10.1016/j.disopt.2008.04.001

A. Claus, A New Formulation for the Travelling Salesman Problem, SIAM Journal on Algebraic Discrete Methods, vol.5, issue.1, pp.21-26, 1984.
DOI : 10.1137/0605004

A. Costa, J. F. Cordeau, and G. Laporte, Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints, Networks, vol.86, issue.2, pp.141-159, 2009.
DOI : 10.1002/j.1538-7305.1957.tb01515.x

M. Fischetti, G. Laporte, and S. Martello, The Delivery Man Problem and Cumulative Matroids, Operations Research, vol.41, issue.6, 1055.
DOI : 10.1287/opre.41.6.1055

L. R. Fox, B. Gavish, and S. C. , Graves 'A N-Constrained formulation of the (Time-dependent)

M. T. Godinho, L. Gouveia, and T. Magnanti, Combined route capacity and route length models for unit demand vehicle routing problems, Discrete Optimization, vol.5, issue.2, pp.350-372, 2008.
DOI : 10.1016/j.disopt.2007.05.001

M. T. Godinho, L. Gouveia, T. Magnanti, P. Pesneau, and J. Pires, On Time-Dependent Models for Unit Demand Vehicle Routing Problems, Proceedings of the INOC2007 Conference, 2007.

M. T. Godinho, L. Gouveia, T. Magnanti, P. Pesneau, and J. Pires, Formulations for the ATSP: contextualizing a strong time dependent flow based formulation

L. Gouveia, Using Hop-Indexed Models For Constrained Spanning and Steiner Tree Models, Telecommunications Network Planning, pp.21-32, 1999.
DOI : 10.1007/978-1-4615-5087-7_2

L. Gouveia and P. Pesneau, On extended formulations for the precedence constrained asymmetric traveling salesman problem, Networks, vol.22, issue.2, pp.77-89, 2006.
DOI : 10.1002/net.20122
URL : https://hal.archives-ouvertes.fr/inria-00281586

L. Gouveia and J. Pires, Uma análise comparativa de formulações para o Problema do Caixeiro Viajante, Investigação Operacional, vol.16, pp.89-114, 1996.

L. Gouveia and J. M. Pires, The asymmetric travelling salesman problem: on generalizations of disaggregated Miller???Tucker???Zemlin constraints, Discrete Applied Mathematics, vol.112, issue.1-3, pp.1-3, 2001.
DOI : 10.1016/S0166-218X(00)00313-9

L. Gouveia, L. Simonetti, and E. Uchoa, Modelling Hop-Constrained and Diameter-Constrained Minimum Spanning Tree Problems as Steiner Tree Problems over Layered Graphs, Mathematical Programming, 2009.

L. Gouveia and S. Voss, A classification of formulations for the (time-dependent) traveling salesman problem, European Journal of Operational Research, vol.83, issue.1, pp.69-82, 1995.
DOI : 10.1016/0377-2217(93)E0238-S

A. Langevin, F. Soumis, and J. Desrosiers, Classification of travelling salesman problem formulations, Operations Research Letters, vol.9, issue.2, pp.127-132, 1990.
DOI : 10.1016/0167-6377(90)90052-7

E. Lawler, J. Lenstra, A. Kan, and D. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization., The Journal of the Operational Research Society, vol.37, issue.5, 1985.
DOI : 10.2307/2582681

C. Miller, A. Tucker, and R. Zemlin, Integer Programming Formulation of Traveling Salesman Problems, Journal of the ACM, vol.7, issue.4, pp.326-329, 1960.
DOI : 10.1145/321043.321046

A. Lucena, Time-dependent traveling salesman problem???the deliveryman case, Networks, vol.26, issue.6, pp.753-763, 1990.
DOI : 10.1002/net.3230200605

I. Méndez-díaz, P. Zabala, and A. Lucena, A new formulation for the Traveling Deliveryman Problem, Discrete Applied Mathematics, vol.156, issue.17, pp.3223-3237, 2008.
DOI : 10.1016/j.dam.2008.05.009

T. Oncan, I. K. Atinel, and G. Laporte, A comparative analysis of several asymmetric traveling salesman problem formulations, Computers & Operations Research, vol.36, issue.3, pp.637-654, 2009.
DOI : 10.1016/j.cor.2007.11.008

J. C. Picard and M. Queyranne, The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling, Operations Research, vol.26, issue.1, pp.86-110, 1978.
DOI : 10.1287/opre.26.1.86

S. C. Sarin, H. D. Sherali, and A. Bhootra, New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints, Operations Research Letters, vol.33, issue.1, pp.62-70, 2005.
DOI : 10.1016/j.orl.2004.03.007

H. D. Sherali and P. J. Driscoll, On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems, Operations Research, vol.50, issue.4, pp.656-669, 2002.
DOI : 10.1287/opre.50.4.656.2865

H. D. Sherali, S. C. Sarin, and P. F. Tsai, A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints, Discrete Optimization, vol.3, issue.1, pp.20-32, 2006.
DOI : 10.1016/j.disopt.2005.10.004

M. Van-vyve and L. A. Wolsey, Approximate extended formulations, Mathematical Programming, vol.48, issue.2-3, pp.501-522, 2006.
DOI : 10.1145/321043.321046

R. T. Wong, Integer programming formulations of the traveling salesman problem, Proceedings of the IEEE international conference of circuits and computers, pp.149-52, 1980.