A classification of formulations for the (time-dependent) traveling salesman problem

[1]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[2]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

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

[4]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

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

[6]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[7]  R. Burkard.  Quadratic Assignment Problems , 1984 .

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

[9]  Abilio Lucena,et al.  Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.

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

[11]  Matteo Fischetti,et al.  The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..

[12]  Armin Scholl,et al.  Produktionsplanung: Ablauforganisatorische Aspekte , 1993 .

[13]  Lucio Bianco,et al.  The traveling salesman problem with cumulative costs , 1993, Networks.

[14]  Luís Gouveia,et al.  A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem , 1995, Oper. Res..