salesman problem

基本解释

• [數學]貨郎擔問題推銷員問題

英汉例句

雙語例句

• One famous example is the travelling salesman problem—finding the shortest route between several cities.
  其中一個著名的例子就是推銷員旅行問題：找出幾個城市之間的最短路線。
• TSP(Traveling Salesman Problem)is a typical NP-hard problem in combinatorial optimization and Genetic Algorithm is one of methods for solving TSP.
  TSP問題是一個經典的NP難度的組郃優化問題，遺傳算法是求解TSP問題的有傚方法之一。
• 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.
  旅行推銷員問題是一個最受人喜愛的數學難題：如果一個推銷員不得不訪問幾個城市，怎樣走最短的路線使他一次到達這幾個城市。

權威例句

• 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
• You can solve the Traveling Salesman problem using glue and paper clips.
  FORBES: Why Job Descriptions Are A Waste Of Paper
• In this problem, a salesman must chart a path through seven cities in which he visits each one only once.
  FORBES: DNA May Make Computers, Not Run Them

• salesman problem更多例句

词组短语

短語

• uncertain traveling salesman problem 不確定tsp問題
• bottleneck travelling salesman problem 瓶頸旅行商問題
• travelling salesman problem tsp 旅行商問題
• chinese traveling salesman problem 中國旅行商問題
• the travelling salesman problem 旅行售貨員問題

• salesman problem更多词组

专业释义

數學

• 貨郎擔問題
• 推銷員問題