E. Balas and M. Fischetti, On the monotonization of polyhedra, Mathematical Programming, vol.58, issue.1, pp.59-84, 1997.
DOI : 10.1002/9781118627372

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

G. Dahl, Notes on polyhedra associated with hop-constrained paths, Operations Research Letters, vol.25, issue.2, pp.97-100, 1999.
DOI : 10.1016/S0167-6377(99)00025-5

G. Dahl, N. Foldnes, and L. Gouveia, A note on hop-constrained walk polytopes, Operations Research Letters, vol.32, issue.4, pp.345-349, 2004.
DOI : 10.1016/j.orl.2003.10.008

M. Desrochers and G. Laporte, Improvements to the Miller-Tucker-Zemlin subtour elimination constraints, Operation Research Letters, pp.27-36, 1991.

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

B. Gavish and S. C. Graves, The traveling salesman problem and related problems, Working Paper OR-078-78, 1978.

L. Gouveia, Using Hop-Indexed Models for Constrained Spanning and Steiner Tree Problems Telecommunications Network Planning, pp.21-32, 1999.

M. T. Godinho, L. Gouveia, and T. Magnanti, Combined Route Capacity and Route Length Models for Unit Demand Vehicle Routing Problems, Discrete Optimization, pp.350-372, 2008.

M. T. Godinho, L. Gouveia, and P. Pesneau, Natural and extended formulations for the Time-Dependent Traveling Salesman Problem, Discrete Applied Mathematics, vol.164, pp.8-2010, 2010.
DOI : 10.1016/j.dam.2011.11.019
URL : https://hal.archives-ouvertes.fr/hal-00648451

L. Gouveia and P. Pesneau, On extended formulations for the precedence constrained asymmetric Traveling Salesman Problem, Networks, pp.77-89, 2006.

L. Gouveia and J. M. Pires, The asymmetric travelling salesman problem and a reformulation of the Miller???Tucker???Zemlin constraints, European Journal of Operational Research, vol.112, issue.1, pp.134-146, 1999.
DOI : 10.1016/S0377-2217(97)00358-5

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.129-145, 2001.
DOI : 10.1016/S0166-218X(00)00313-9

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

R. Loulou, On multicomodity ow formulations for the TSP, 1988.

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

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

A. Orman and H. Williams, A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem, Advances in Computational Management Science, vol.9, pp.91-104, 2007.
DOI : 10.1007/3-540-36626-1_5

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 W. P. Adams, A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems, SIAM Journal on Discrete Mathematics, vol.3, issue.3, pp.411-430, 1990.
DOI : 10.1137/0403036

H. D. Sherali and W. P. Adams, A hierarchy of relaxations and convex hull characterizations for mixed-integer zero???one programming problems, Discrete Applied Mathematics, vol.52, issue.1, pp.83-106, 1994.
DOI : 10.1016/0166-218X(92)00190-W

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 ow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints, Discrete Optimization, pp.20-32, 2006.

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.