Several branch-and-bound algorithms for the exact solution of the asymmetric traveling salesman problem (ATSP), based on the assignment problem (AP) relaxation, have been proposed in the literature.

Prof. Paul Cuff, Princeton University, Spring Semester 2014-15. Homework assignment are due bi-weekly on Fridays (alternating with lab write-up due dates). Late assignments will be deducted 20% each ...