Prior content: Algorithms on Graphs

Previous Section: Route Inspection

Next Section: Linear Programming

This whole chapter is A level only (not needed for AS Further Maths).

Contents

Whole Topic Notes

Full Notes to Accompany Examples
Dr Frost
FMSP Whole Chapter Videos

5A The Classical and Practical Travelling Salesman Problems*

Textbook resources

FMSP Video Courtesy of MEI

Download Blank Notes
Download Slides

PowerPoint (Westie’s Workshop, in the style of Owen134866)

Dr Frost resources

No Live Lesson Video Yet

Download Slides
Key Skills

Note all numbers are subject to change and will be updated once all key skills have been finished by Dr Frost

5B Using a Minimum Spanning Tree Method to Find an Upper Bound*

Textbook resources

FMSP Video Courtesy of MEI

Download Blank Notes
Download Slides

PowerPoint (Westie’s Workshop, in the style of Owen134866)

Dr Frost resources

5C Using a Minimum Spanning Tree Method to Find a Lower Bound*

Textbook resources

FMSP Video Courtesy of MEI

Download Blank Notes
Download Slides

PowerPoint (Westie’s Workshop, in the style of Owen134866)

Dr Frost resources

5D Using the Nearest Neighbour Algorithm to Find an Upper Bound*

Textbook resources

FMSP Video Courtesy of MEI

Download Blank Notes
Download Slides

PowerPoint (Westie’s Workshop, in the style of Owen134866)

Dr Frost resources

Whole Topic Summary Resources (Including Past Paper Questions)

External whole topic past paper style questions
  • WW Dr Frost Style QQQs (Version 1) Word Doc, PDF (Q’s Only) or PDF (Q’s & Sol.)
  • WW Dr Frost Style QQQs (Version 2) Word Doc, PDF (Q’s Only) or PDF (Q’s & Sol.)
Worksheets