Resources tagged with: Travelling salesperson problem
There are 3 NRICH Mathematical resources connected to Travelling salesperson problem, you may find related items under Decision mathematics and combinatorics.
Broad Topics > Decision mathematics and combinatorics > Travelling salesperson problem
Problem
Primary curriculum
Secondary curriculum
The Olympic Torch Tour
Imagine you had to plan the tour for the Olympic Torch. Is there an efficient way of choosing the shortest possible route?
Age 14 to 16
Challenge Level 
Problem
Primary curriculum
Secondary curriculum
Travelling Salesman
A Hamiltonian circuit is a continuous path in a graph that passes through each of the vertices exactly once and returns to the start. How many Hamiltonian circuits can you find in these graphs?
Age 11 to 14
Challenge Level
Problem
Primary curriculum
Secondary curriculum
Only Connect
The graph represents a salesman’s area of activity with the shops that the salesman must visit each day. What route around the shops has the minimum total distance?
Age 11 to 14
Challenge Level