Project 3 - Best-first Branch-and-Bound TSP

Due: Dec. 10 (T), 2002

Implement a best-first branch-and-bound version of TSP.

Demonstrate that your program gives the correct answer.

Compare the execution time between your backtracking solution and your best-first branch-and-bound version on several data sets.