Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem

This publication has 13 references indexed in Scilit:

• Solution of large dense transportation problems using a parallel primal algorithm
  Operations Research Letters, 1990
• A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions
  Information Processing Letters, 1986
• Performance of parallel branch-and-bound algorithms
  IEEE Transactions on Computers, 1985
• Anomalies in parallel branch-and-bound algorithms
  Communications of the ACM, 1984
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
  Management Science, 1980
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
  SIAM Journal on Computing, 1979
• The traveling-salesman problem and minimum spanning trees: Part II
  Mathematical Programming, 1971
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms
  Operations Research, 1971
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
  Operations Research, 1968
• An Algorithm for the Traveling Salesman Problem
  Operations Research, 1963