A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem [chapter]

A.J. Orman, H.P. Williams
Optimisation, Econometric and Financial Analysis  
Eight distinct (and in some cases little known) formulations of the Travelling Salesman Problem as an Integer Programme are given. Apart from the standard formulation all the formulations are 'compact' in the sense that the number of constraints and variables is a polynomial function of the number of cities in the problem. Comparisons of the formulations are made by projecting out variables in order to produce polytopes in the same space. It is then possible to compare the strengths of the
more » ... rengths of the Linear Programming relaxations. These results are illustrated by computational results on a small problem.
doi:10.1007/3-540-36626-1_5 fatcat:qivvd67fbjcczaorcomq5ggjsm