The Travelling Salesman Problem is a classic problem of Combinatorial Optimisation and involves routing around a number of cities in order to cover the minimum total distance. It is notoriously difficult to solve practical sized instances optimally. The classical Integer Programming formulation involves an exponential number of constraints.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • H. P. Williams
    • 1
  1. 1.Department of Operational ResearchThe London School of EconomicsLondonUK

Personalised recommendations