Search by Topic

Resources tagged with Travelling salesperson problem similar to Only Connect:

Filter by: Content type:
Stage:
Challenge level: Challenge Level:1 Challenge Level:2 Challenge Level:3

There are 3 results

Broad Topics > Decision Mathematics and Combinatorics > Travelling salesperson problem

problem icon

Only Connect

Stage: 3 Challenge Level: Challenge Level:1

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?

problem icon

Travelling Salesman

Stage: 3 Challenge Level: Challenge Level:1

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

The Olympic Torch Tour

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

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


The NRICH Project aims to enrich the mathematical experiences of all learners. To support this aim, members of the NRICH team work in a wide range of capacities, including providing professional development for teachers wishing to embed rich mathematical tasks into everyday classroom practice. More information on many of our other activities can be found here.
Copyright © 1997 - 2012. University of Cambridge. All rights reserved.
NRICH is part of the family of activities in the Millennium Mathematics Project.