NP-Complete refers to the hardest known problems within the complexity class NP. The "Traveling salesman problem" is one of the most widely known NP-Complete problems.

- Wiki
2 articles, 0 books.

Let’s consider a map of locations. A salesperson wants to visit each location exactly once. What’s the optimal route? This is a classic problem in computer science called the travelling salesman problem.