Travelling salesman problem

The travelling salesman problem (TSP) 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.

单词	Salesman Problem
释义	Salesman Problem 原声例句《金融时报》 Podcast We can solve the travelling salesman problem and we do for customers. 我们可以解决旅行推销员问题，我们为客户做。英语百科 Travelling salesman problem The travelling salesman problem (TSP) 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.
随便看	give somebody the bird give somebody the bounce give somebody the cold shoulder give somebody the creeps give somebody the eye give somebody the shaft give somebody the slip give somebody what for give some colour of truth to give some notion give someone give someone a backhanded compliment give someone a bad turn give someone a bell give someone a belt give someone a big hand give someone a big head give someone a bit of curry give someone a black eye give someone a black look give someone a bloody nose give someone a break give someone a brush give someone a buzz give someone a chance

Salesman Problem

Travelling salesman problem