A new class of cutting planes for the symmetric travelling salesman problem

1. G. Cornuéjols, J. Fonlupt and D. Naddef, “The graphical travelling salesman problem and some related integer polyhedra,” Research Rep. 378, Lab. d'Informatique et de Math. Appl. de Grenoble, May 1983.

2. G. Cornuéjols, J. Fonlupt and D. Naddef, “The travelling salesman problem on a graph and some related integer polyhedra,”Mathematical Programming 33 (1985) 1–27.

   Google Scholar 

3. H. Crowder and M.W. Padberg, “Solving large-scale symmetric travelling salesman problems to optimality,”Management Science 26 (1980) 495–509.

   Google Scholar 

4. B. Fleischmann, “Distance conserving reductions for non-oriented networks,”OR Spektrum 5 (1983) 195–205.

   Google Scholar 

5. B. Fleischmann, “A cutting plane procedure for the travelling salesman problem on road networks,”European Journal of Operations Research 21 (1985) 307–317.

   Google Scholar 

6. M. Grötschel, “On the symmetric travelling salesman problem: Solution of a 120-city problem,”Mathematical Programming Studies 12 (1980) 61–77.

   Google Scholar 

7. M. Grötschel and M.W. Padberg, “On the symmetric travelling salesman problem I: Inequalities,”Mathematical Programming 16 (1979) 265–280.

   Google Scholar 

8. M. Grötschel and M.W. Padberg, “Polyhedral theory,” in: E.L. Lawler et al., eds.,The Travelling Salesman Problem (J. Wiley & Sons, 1985), pp. 251–305.

9. M. Grötschel and W.R. Pulleyblank, “Clique tree inequalities and the travelling salesman problem,” to appear inMathematics of Operations Research.

10. A. Land, “The solution of some 100-city travelling salesman problems,” Report, London School of Economics 1979.

11. G. Laporte and Y. Nobert, “A cutting planes algorithm for the n-salesman problem,”Journal of the Operational Research Society 31 (1980) 1017–1023.

    Google Scholar 

12. P. Miliotis, “Using cutting planes to solve the symmetric travelling salesman problem,”Mathematical Programming 15 (1978) 177–188.

    Google Scholar 

13. P. Miliotis, G. Laporte and Y. Nobert, “Computational experience of two methods for finding the shortest complete cycle or circuit in a graph,”RAIRO 15 (1981), 233–239.

    Google Scholar 

14. M.W. Padberg and S. Hong, “On the symmetric travelling salesman problem: A computational study,”Mathematical Programming Studies 12 (1980) 78–107.

    Google Scholar 

15. A. Volgenant, R. Jonker and G.A.P. Kindervater, “A note on finding a shortest complete cycle in an undirected graph,”European Journal of Operations Research 23 (1986) 82–85.

    Google Scholar 

16. L.A. Wolsey, “Heuristic analysis, linear programming and branch and bound,”Mathematical Programming Studies 13 (1980) 121–134.

    Google Scholar 

Download references