The travelling salesman problem (also called the traveling salesperson problem[1] or TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?"
a) Greedy
b) Dynamic Programming (DP)
c) Branch and Bound
d) Backtracing