The travelling salesman problem, also known as the travelling salesperson problem (TSP), asks the following question: "Given a list of cities and the...

peddler. Travelling salesman may also refer to: Travelling salesman problem, in discrete or combinatorial optimization The Traveling Salesman, a 1908 play...

The Bottleneck traveling salesman problem (bottleneck TSP) is a problem in discrete or combinatorial optimization. The problem is to find the Hamiltonian...

The Steiner traveling salesman problem (Steiner TSP, or STSP) is an extension of the traveling salesman problem. Given a list of cities, some of which...

unlike the Travelling Salesman Problem which is NP-hard. It is different from the Travelling Salesman Problem in that the travelling salesman cannot repeat...

and traveling. The traveling salesman problem (TSP) is a special case of this problem. The problem can be seen as a generalization of the traveling salesman...

Travelling Salesman is a 2012 intellectual thriller film about four mathematicians who solve the P versus NP problem, one of the most challenging mathematical...

to deliver to a given set of customers?" It generalises the travelling salesman problem (TSP). It first appeared in a paper by George Dantzig and John...

approximation is described by Jon Bentley for solving the travelling salesman problem (TSP): "Given a list of cities and the distances between each pair...

the first algorithms used to solve the travelling salesman problem approximately. In that problem, the salesman starts at a random city and repeatedly...