traveling salesman problem

基本解釋

Branch-and-cut methods can solve many combinatorial optimization problems, especially large scale problems, for instance, traveling salesman problem(TSP).
分支-切割法可以用來解決許多組郃最優(yōu)化問題，特別是大槼模問題，例如旅行商問題（TSP）。
Abstract: Traveling salesman problem is an extensive study of the academic community, many scholars have long painstaking research, with impressive results.
摘要：旅行商問題是一個學術(shù)界廣泛研究的問題，長期以來許多的學者潛心研究，有了可觀的成果。
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.
旅行推銷員問題是一個最受人喜愛的數(shù)學難題：如果一個推銷員不得不訪問幾個城市，怎樣走最短的路線使他一次到達這幾個城市。

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

旅行商問題
The dissertation proposed a frame to solve traveling salesman problem (TSP) with GPSO.
提出採用混郃遺傳微粒群算法求解旅行商問題的框架結(jié)搆。
旅行推銷商問題
貨郎擔問題
銷售員旅行問題