Travelling Salesman Problem

The aim is to visit every vertex of the network and return to the starting vertex using the route that has the minimum total weight.

• Teachers notes (Word document or PDF)
• Topic Introduction Presentation (Powerpoint)
• Student exercise (Word document or PDF) and a shorter student exercise (PDF)