William J. Cook, Mark Hartmann. On the Complexity of Branch and Cut Methods for the Traveling Salesman Problem. In William J. Cook, Paul D. Seymour, editors, Polyhedral Combinatorics, Proceedings of a DIMACS Workshop, Morristown, New Jersey, USA, June 12-16, 1989. Volume 1 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 75-82, DIMACS/AMS, 1990.
No references recorded for this publication.
No citations of this publication recorded.