A cutting plane procedure for the travelling salesman problem on road networks

[1]  Gilbert Laporte,et al.  Two exact algorithms for the distance-constrained vehicle routing problem , 1984, Networks.

[2]  B. Fleischmann,et al.  Distance conserving reductions for nonoriented networks , 1983 .

[3]  G. Laporte,et al.  A branch and bound algorithm for the capacitated vehicle routing problem , 1983 .

[4]  Gilbert Laporte,et al.  A Cutting Planes Algorithm for the m-Salesmen Problem , 1980 .

[5]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[6]  Martin Grötschel,et al.  On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..

[7]  P. Miliotis,et al.  Using cutting planes to solve the symmetric Travelling Salesman problem , 1978, Math. Program..

[8]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[9]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

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

[11]  Martin Grötschel,et al.  On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .

[12]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[13]  Martin Grötschel,et al.  Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme , 1977 .

[14]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .