One famous example is the travelling salesman problem-finding the shortest route between several cities.

其中一个著名的例子就是推销员旅行问题：找出几个城市之间的最短路线。

youdao

We present an algorithm about Traveling Salesman problem through the method of Self saturated Subscript in Cycle.

通过圈上结点下标自足方法，给出了一个关于旅行推销员问题的算法。

youdao

Abstract: Traveling salesman problem is an extensive study of the academic community, many scholars have long painstaking research, with impressive results.

摘要：旅行商问题是一个学术界广泛研究的问题，长期以来许多的学者潜心研究，有了可观的成果。

youdao

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

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