The Travelling Salesman Problem (free preview)

This is a 24 slide free, sample preview of my 50 slide PowerPoint presentation covering all the content of Chapter 5 of Edexcel’s A-Level book “Decision Mathematics 1” (2017+ specification).

This includes:

• Minimum Spanning Tree (Upper Bound)

• Looking for Shortcuts

• Residual Minimum Spanning Tree (Lower Bound)

• Nearest Neighbour (Upper Bound)

The slide set makes extensive use of PowerPoint animations to clearly explain the involved algorithms.

I have provided teacher notes, where necessary, for each slide.

I have also used an extended practical example throughout the presentation relating to band’s (XTC) actual, short tour of the UK in 1979. The intent is to emphasis that the algorithm has practical uses in the real world.

Necessary terminology is revised, as is Kruskal’s and Prim’s algorithm’s for finding a Minimum Spanning Tree (MST).

I hope you find the PowerPoint presentation useful within your teaching.

Regards

Gerard