Travelling salesman problem: branch and bound algorithm