A Parallel Branch-and-Bound Method for the Traveling Salesman Problem and Its Implementation on a Nerwork of PCs