traveling salesman problem

基本解釋

• 旅行商問題；貨郎擔(dān)問題

英漢例句

雙語例句

• 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.
  摘要：旅行商問題是一個學(xué)術(shù)界廣泛研究的問題，長期以來許多的學(xué)者潛心研究，有了可觀的成果。
• 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ù)學(xué)難題：如果一個推銷員不得不訪問幾個城市，怎樣走最短的路線使他一次到達(dá)這幾個城市。

權(quán)威例句

• 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

• traveling salesman problem更多例句

詞組短語

短語

• asymmetric traveling salesman problem 非對稱旅行商問題
• the Traveling Salesman Problem 旅行商問題
• multiple traveling salesman problem 多旅行商問題
• TimeLimited Traveling Salesman Problem 有時限的貨郎擔(dān)問題
• uncertain traveling salesman problem 不確定tsp問題

• traveling salesman problem更多詞組

專業(yè)釋義

計算機科學(xué)技術(shù)

• 旅行商問題

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

• 旅行推銷商問題
• 貨郎擔(dān)問題
• 銷售員旅行問題

數(shù)學(xué)

• 貨郎擔(dān)問題

電子、通信與自動控制技術(shù)

• 巡廻售貨員問題
• 廻售貨員問題

地球科學(xué)

• 貨郎行程問題