On the Complexity of Branch and Cut Methods for the Traveling Salesman Problem