traveling salesman problem

基本解释

• 旅行商问题；货郎担问题

英汉例句

双语例句

• Branch-and-cut methods can solve many combinatorial optimization problems, especially large scale problems, for instance, traveling salesman problem(TSP).
  分支-切割法可以用来解决许多组合最优化问题，特别是大规模问题，例如旅行商问题（TSP）。
• Abstract: Traveling salesman problem is an extensive study of the academic community, many scholars have long painstaking research, with impressive results.
  摘要：旅行商问题是一个学术界广泛研究的问题，长期以来许多的学者潜心研究，有了可观的成果。
• 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.
  旅行推销员问题是一个最受人喜爱的数学难题：如果一个推销员不得不访问几个城市，怎样走最短的路线使他一次到达这几个城市。

权威例句

• 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 有时限的货郎担问题
• uncertain traveling salesman problem 不确定tsp问题

• traveling salesman problem更多词组

专业释义

计算机科学技术

• 旅行商问题

  The dissertation proposed a frame to solve traveling salesman problem (TSP) with GPSO.
  提出采用混合遗传微粒群算法求解旅行商问题的框架结构。

• 旅行推销商问题
• 货郎担问题
• 销售员旅行问题

数学

• 货郎担问题

电子、通信与自动控制技术

• 巡回售货员问题
• 回售货员问题

地球科学

• 货郎行程问题