Answer: d. Travelling Salesman problem
Explanation: The TSP or Travelling Salesman problem is about finding the shortest possible route to visit each city only once and returning to the origin city when the list of all cities and distances between each pair of cities is given.