External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On the Complexity of Branch and Cut Methods for the Traveling Salesman Problem

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.

Abstract

Abstract is missing.

runs on