Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time

Robert Carr. Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time. In William H. Cunningham, S. Thomas McCormick, Maurice Queyranne, editors, Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings. Volume 1084 of Lecture Notes in Computer Science, pages 460-474, Springer, 1996.

Abstract

Abstract is missing.