A branch and bound algorithm for the porbabilistic traveling salesman problem | IEEE Conference Publication | IEEE Xplore