A Level Further Maths Revision
A Level Further Maths
For Students Studying AL Further Maths
-
Gain Access to all AJMaths A Level Further Maths Revision Videos
-
Gain Access to all AJMaths A Level Further Maths Worksheets
-
Gain Access to all AJMaths A Level Further Maths Mock Papers
Edexcel A Level Further Mathematics - Decision 1
Travelling Salesman Problem
The Travelling Salesman Problem requires us to find the shortest possible route that visits each location exactly once and returns to the start.
It is an example of a optimisation problem, often solved using heuristics or algorithms rather than exact methods.
After watching the AJMaths revision videos on the Travelling Salesman Problems I will be able to:
- Complete a Table of Least Distances
- Use a Minimum Spanning Tree Method to Find a Lower Bound
- Use a Minimum Spanning Tree Method to Find an Upper Bound
- Using the Nearest Neighbour Algorithm
- Answer Exam Questions on the Travelling Salesman Problems for Further Pure 1
Classical and Practical Travelling Salesman Problems
In this video we will take a look at introducing the classical and practical travelling salesman problems.
Using a Minimum Spanning Tree Method to Find a Lower Bound
In this video we will discover how we can use a minimum spanning tree method to find a lower bound.
Using a Minimum Spanning Tree Method to Find an Upper Bound
In this video we will discover how we can use a minimum spanning tree method to find an upper bound.
Using the Nearest Neighbour Algorithm
In this video we will introduce an algorithm that will easily allow us to find an upper bound for a given network, namely, the nearest neighbour algorithm.
Exam Revision for The Travelling Salesman Problem
In this video we will introduce our first conic section, parabolas!
Worksheets for The Route Inspection Algorithm
Still Revising?
Boost your Grades today and become a member!
Click the button below to become a member
