Solving Small TSPs with Constraints
a branch - and - cut algorithm for the resolution of large - scale symmetric traveling salesman problems .