Sign inSign in
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.
as Robert Sapolsky defines itStanford UniversityThe wording closest to all 3 definitions
Watch it explained

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

3

Each in their own terms, from the easiest level.

  • Jon Bentley

    MIT · Undergraduate

    The problem of finding a circuit visiting a given set of cities that minimizes the total distance traveled.
    • 7:44Tuning a TSP Algorithm
  • Kate Smith-Miles

    University of Melbourne · Graduate

    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.
    • 6:08AI in Science and Engineering: Towards Trustworthy AI and Quantum Technologies

Connections

10

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.