In this paper, we use a reformulation of the symmetric and the asymmetric travelling salesman problem more suitable for Lagrangean relaxation and analyse the new approach on examples from TSP Lib. Furthermore the Lagrangean relaxed subproblems are travelling salesman alike which means that...

We provide two different neighborhood construction techniques for creating exponentially large neighborhoods that are searchable in polynomial time using dynamic programming. We illustrate both of these approaches on very large scale neighborhood search techniques for the traveling salesman...