Question:

The Travelling Salesman’s is an example of which of the following class of problems?

Show Hint

The Travelling Salesman Problem is NP-hard and does not have a polynomial-time solution unless P = NP.
Updated On: May 3, 2025
  • NP-hard
  • P
  • C
  • NP but not NP-hard
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

The Travelling Salesman Problem (TSP) is a classic problem in combinatorial optimization. It is known to be NP-hard, meaning that no polynomial-time algorithm is known to solve it efficiently, and it is at least as hard as the hardest problems in NP.
Thus, the correct answer is \( \text{NP-hard} \).
Was this answer helpful?
0
0