Solving the traveling salesman problem with a parallel branch-and-bound algorithm on a 1024 processor network
