Design and use of the CPAN branch and bound for the solution of the travelling salesman problem (TSP) | IEEE Conference Publication | IEEE Xplore