Implementation of a parallel branch-and-bound algorithm for the travelling salesman problem