【travelling_salesman_problem】什么意思_英语travelling_salesman_problem的翻译_音标_读音_用法_例句_在线翻译

·2,447,543篇论文数据，部分数据来源于NoteExpress

abstract: The travelling salesman problem (TSP) or travelling salesperson problem asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.

以上来源于: WordNet

Take the travelling salesman problem, for example.

比方说旅行推销员问题。

youdao
Till now, the best published result of Chinese-Travelling Salesman Problem is 15904km.

迄今为止，中国旅行商问题的最优解是15904公里。

youdao
Second, we apply all of them to 10-city travelling salesman problem (TSP), respectively.

其次将四种方法分别应用于10个城市的旅行推销商问题。

youdao

更多双语例句

Tackling a Travelling Salesman Problem that has lots of locations with a supercomputer can take years because even the most powerful supercomputers use only a few thousand processors.

BBC: Processing power of single cells
The field of DNA computing was kicked off in 1994 when Leonard Adleman used strands of DNA to solve a simple example of a mathematical conundrum known as the Travelling Salesman Problem.

BBC: Processing power of single cells

应用推荐

$firstVoiceSent

- 来自原声例句

travelling salesman problem