Computing compatible tours for the symmetric traveling salesman problem (2011)

by M Fortini, A Letchford, A Lodi, K Wenger
Venue:Mathematical Programming Computation