traveling salesman problem
An example of an NP problem where finding the shortest route to visit multiple cities is difficult, but verifying a given route's length is easy.
Videos Mentioning traveling salesman problem
The greatest unsolved problem in computer science...
Fireship
An example of an NP problem where finding the shortest route to visit multiple cities is difficult, but verifying a given route's length is easy.
Juergen Schmidhuber: Godel Machines, Meta-Learning, and LSTMs | Lex Fridman Podcast #11
Lex Fridman
A classic combinatorial optimization problem where one seeks the shortest possible route that visits a set of cities exactly once and returns to the origin city. It's used as an example to illustrate theoretical optimal problem-solving methods versus practical ones.
Quantum Computers Could Solve These Problems
Sabine Hossenfelder
A classic optimization problem in logistics that seeks the shortest possible route to visit a set of destinations and return to the origin, difficult for classical computers.
Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111
Lex Fridman
A classic NP-hard combinatorial optimization problem where the goal is to find the shortest possible route that visits each city exactly once and returns to the origin city.
Brian Kernighan: UNIX, C, AWK, AMPL, and Go Programming | Lex Fridman Podcast #109
Lex Fridman
A well-known optimization problem, mentioned in the context of Brian Kernighan's work on heuristics with Shen Lin.