A classic problem in combinatorial optimization and computer science where the goal is to find the shortest possible route that visits each city exactly once and returns to the origin city.

"The traveling salesman problem is an NP-hard problem with many real-world applications."