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.
このアルゴリズムは巡回セールスマンの問題を近似的に解く。
This algorithm approximately solves the traveling salesman problem.
From English 'traveling salesman problem', translated into Japanese as 巡回 (patrol/circuit) + セールスマン (salesman) + 問題 (problem).