A comparative analysis of several asymmetric traveling salesman problem formulations

[1]  A. Trudeau.  Planification des tournées de véhicules pour l'approvisionnement de dépanneurs , 2008 .

[2]  H. P. Williams,et al.  A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem , 2007 .

[3]  Hanif D. Sherali,et al.  A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints , 2006, Discret. Optim..

[4]  Hanif D. Sherali,et al.  New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints , 2005, Oper. Res. Lett..

[5]  Hanif D. Sherali,et al.  On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems , 2002, Oper. Res..

[6]  Luís Gouveia,et al.  The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints , 2001, Discret. Appl. Math..

[7]  Young-Soo Myung.  Projections of Extended Formulations with Precedence Variables for the Asymmetric Traveling Salesman Problem , 2001 .

[8]  Luís Gouveia,et al.  The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints , 1999, Eur. J. Oper. Res..

[9]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[10]  L. Gouveia.  A result on projection for the vehicle routing ptoblem , 1995 .

[11]  S. Voß,et al.  A classification of formulations for the (time-dependent) traveling salesman problem , 1995 .

[12]  Patrick J. Driscoll,et al.  A new hierarchy of relaxations for 0-1 mixed integer problems with application to some specially structured problems , 1995 .

[13]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[14]  Ting-Yi Sung,et al.  An analytical comparison of different formulations of the travelling salesman problem , 1991, Math. Program..

[15]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[16]  André Langevin,et al.  CLASSIFICATION OF TRAVELING SALESMAN PROBLEM FORMULATIONS , 1988 .

[17]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[18]  A. Claus.  A new formulation for the travelling salesman problem , 1984 .

[19]  Egon Balas,et al.  The perfectly matchable subgraph polytope of a bipartite graph , 1983, Networks.

[20]  Stephen C. Graves,et al.  Technical Note - An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem , 1980, Oper. Res..

[21]  Stephen C. Graves,et al.  The Travelling Salesman Problem and Related Problems , 1978 .

[22]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[23]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[24]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.