This is the 18th video of the lecture series Optimization using Excel. Here we have discussed how to solve a Travelling Salesman Problem (TSP) problem using Integer Programming. A TSP is a specific type of network where the flow unit will start from a node and terminate the journey at the same node after visiting all the other nodes of the network only once. The objective is to minimize the total distance traveled.