Shortest Hamilton Road Problem

The problem of finding the shortest path through all vertices once. It’s a “path,” so it doesn’t go back to the starting point.

The case of returning to the starting point is called the Shortest Hamiltonian closed circuit problem.

• TSP also known as. It seems that even if they don’t return to the starting point, they’re perceived as if they’re salesmen who never return.

---

This page is auto-translated from /nishio/最短ハミルトン路問題 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.