I'm looking at your standard definition of the TSP.... (see wikipedia).... and in the statement leading up to the definition, it states that we must return to the city we began from. Which constraint makes sure that this is the case? http://en.wikipedia.org/wiki/Travelling_salesman_problem#Integer_linear_programming_formulation
Travelling Salesman Problem - where's the return to city-constraint?
algorithms