ConceptAI & ML
Traveling salesperson problem
The problem of finding the shortest possible route to visit a set of different locales or cities and return to the origin.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Jon Bentley
The problem of finding a circuit visiting a given set of cities that minimizes the total distance traveled.Kate Smith-Miles
A problem where a salesperson must visit a specific set of cities, each only once, and return to the first city in the most efficient route.
Connections
10The lectures that define it or assume it, and the concepts next to it.