traveling salesman problem

常見(jiàn)例句

Branch-and-cut methods can solve many combinatorial optimization problems, especially large scale problems, for instance, traveling salesman problem(TSP).
分支-切割法可以用來(lái)解決許多組合最優(yōu)化問(wèn)題，特別是大規(guī)模問(wèn)題，例如旅行商問(wèn)題（TSP）。
Abstract: Traveling salesman problem is an extensive study of the academic community, many scholars have long painstaking research, with impressive results.
摘要：旅行商問(wèn)題是一個(gè)學(xué)術(shù)界廣泛研究的問(wèn)題，長(zhǎng)期以來(lái)許多的學(xué)者潛心研究，有了可觀(guān)的成果。
The traveling salesman problem is a favorite math conundrum: if a salesman has to visit a bunch of cities, how do you get him to all of them once via the shortest possible route.
旅行推銷(xiāo)員問(wèn)題是一個(gè)最受人喜愛(ài)的數(shù)學(xué)難題：如果一個(gè)推銷(xiāo)員不得不訪(fǎng)問(wèn)幾個(gè)城市，怎樣走最短的路線(xiàn)使他一次到達(dá)這幾個(gè)城市。

You can solve the Traveling Salesman problem using glue and paper clips.
FORBES: Why Job Descriptions Are A Waste Of Paper
Adleman mimicked this process in the laboratory, and used it to solve something called the traveling-salesman problem.
FORBES: DNA May Make Computers, Not Run Them