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

Jean-Maurice Clochard, Denis Naddef. Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. In Giovanni Rinaldi, Laurence A. Wolsey, editors, Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993. pages 291-311, CIACO, 1993.

Abstract

Abstract is missing.