What you need to know
Check yourself against these “I can” statements.
- I can tell the classical travelling salesman problem from the practical one
- I can make a table of least distances for a network
- I can find an upper bound with the nearest neighbour algorithm and improve it with short cuts
- I can find a lower bound using a residual minimum spanning tree
These are the pages for The travelling salesman problem in the International A Level scheme of work, following Pearson Edexcel International Advanced Level Mathematics, Further Mathematics and Pure Mathematics (2018). Open this topic in Mr Wells Maths to see it alongside the rest of the course.