Search by Topic

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 icon

The Olympic Torch Tour

Age 14 to 16 Challenge Level:

Imagine you had to plan the tour for the Olympic Torch. Is there an efficient way of choosing the shortest possible route?

problem icon

Travelling Salesman

Age 11 to 14 Challenge Level:

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?

problem icon

Only Connect

Age 11 to 14 Challenge Level:

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?