Alsoじゅんかいセールスマンのもんだい
- travelling salesman problem; TSPcomputing
noun (common) (futsuumeishi)
Generated: This term refers to a classic optimization problem in computer science and operations research. The challenge is to find the shortest possible route for a salesman to visit a set of cities and return to the starting point, visiting each city only once.