TSP Parallel formulation for the Traveling Salesman Problem (TSP) using branch and bound. Several heuristics are used for better bounding.