traveling salesman problem

基本解釋

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

英漢例句

雙語(yǔ)例句

• 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é)者潛心研究，有了可觀的成果。
• 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)員不得不訪問(wèn)幾個(gè)城市，怎樣走最短的路線使他一次到達(dá)這幾個(gè)城市。

權(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更多例句

詞組短語(yǔ)

短語(yǔ)

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

• traveling salesman problem更多詞組

專(zhuān)業(yè)釋義

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

• 旅行商問(wèn)題

  The dissertation proposed a frame to solve traveling salesman problem (TSP) with GPSO.
  提出采用混合遺傳微粒群算法求解旅行商問(wèn)題的框架結(jié)構(gòu)。

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

數(shù)學(xué)

• 貨郎擔(dān)問(wèn)題

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

• 巡回售貨員問(wèn)題
• 回售貨員問(wèn)題

地球科學(xué)

• 貨郎行程問(wèn)題