巡じゅん回かいセールスマンの問もん題だい

noun

traveling salesman problem; TSP

Computing term for the classic optimization problem of finding the shortest route visiting a set of points and returning to the start.

• 巡じゅん回かいセールスマンの問もん題だいは、計けい算さん機き科か学がくでよく研けん究きゅうされている。

  The traveling salesman problem is well-studied in computer science.