Using path inequalities in a branch and cut code for the symmetric traveling salesman problem (1993)

by J-M Clochard, D Naddef
Venue:in: Third IPCO Conference