E. Balas, M. Fischetti, and W. R. Pulleyblank, The precedence-constrained asymmetric traveling salesman polytope, Mathematical Programming, pp.241-265, 1995.
DOI : 10.1007/BF01585767

M. O. Ball, W. Liu, and W. R. Pulleyblank, Two terminal steiner tree polyhedra, Contributions to operations research and economics, pp.251-284, 1989.

M. Barbato, R. Grappe, M. Lacroix, and R. W. Calvo, A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks, Combinatorial Optimization: 4th International Symposium, ISCO 2016, pp.260-272, 2016.
DOI : 10.1007/978-3-642-02017-9_38

A. A. Cire and W. Van-hoeve, Multivalued Decision Diagrams for Sequencing Problems, Operations Research, vol.61, issue.6, pp.1411-1428, 2013.
DOI : 10.1287/opre.2013.1221

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

M. Desrochers and G. Laporte, Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints, Operations Research Letters, vol.10, issue.1, pp.27-36, 1991.
DOI : 10.1016/0167-6377(91)90083-2

M. T. Godinho, L. Gouveia, and P. Pesneau, On a time-dependent formulation and an updated classification of ATSP formulations, Progress in Combinatorial Optimization, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00648457

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. 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 M. Ruthmair, Load-dependent and precedence-based models for pickup and delivery problems, Computers & Operations Research, vol.63, pp.56-71, 2015.
DOI : 10.1016/j.cor.2015.04.008

M. Grötschel, M. Jünger, and G. Reinelt, A Cutting Plane Algorithm for the Linear Ordering Problem, Operations Research, vol.32, issue.6, pp.1195-1220, 1984.
DOI : 10.1287/opre.32.6.1195

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

A. N. Letchford and J. Salazar-gonzález, Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem, European Journal of Operational Research, vol.251, issue.1, pp.74-84, 2016.
DOI : 10.1016/j.ejor.2015.11.001

K. Menger, Zur allgemeinen Kurventheorie, Fundamenta Mathematicae, vol.10, pp.96-115, 1927.
DOI : 10.4064/fm-10-1-96-115

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. Alt?nel, 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

R. Roberti and P. Toth, Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison, EURO Journal on Transportation and Logistics, vol.7, issue.1, pp.113-133, 2012.
DOI : 10.1002/net.3230070103

R. Wong, Integer programming formulations of the travelling salesman problem, Proceedings of the IEEE International Conference of Circuits and Computers, pp.149-152, 1980.