Branch & Bound

The travelling salesman problem is a popular optimization problem in computer-science and mathematics. All students of computer science will study this problem at some point in their academic paths. The motivation behind the Travelling Salesman Problem is the problem faced by a salesperson who needs to visit a number of customers located in different cities […]