Login / Signup
On the Complexity of Branch and Cut Methods for the Traveling Salesman Problem.
William J. Cook
Mark Hartmann
Published in:
Polyhedral Combinatorics (1990)
Keyphrases
</>
traveling salesman problem
combinatorial optimization
search methods