Question

Travelling salesman problem is an example of [MCQ]

Answer 1

traveling salesman problem is an example of the most notorious computational problem.

Answer 2

Explanation:

Travelling salesman problem is the most notorious computational problem. We can use brute-force approach to evaluate every possible tour and select the best one. ... Instead of brute-force using dynamic programming approach, the solution can be obtained in lesser time, though there is no polynomial time algorithm.