Using path inequalities in a branch and cut code for the symmetric traveling salesman problem.

Jean-Maurice Clochard, Denis Naddef

Browse the full IPCO paper archive.