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更多词组

专业释义

数学

• 货郎担问题
• 推销员问题