搜尋結果
traveling salesman problem
- IPA[ˈtrav(ə)liNG ˈsālzmən ˈpräbləm]
- a mathematical problem in which one tries to find the shortest route that passes through each of a set of points once and only once.
noun: travelling salesman problem, plural noun: traveling salesman problems