8. The Travelling Salesperson Problem

Home > Legacy A-Level Maths & Further Maths 2004 > AQA Decision 1 (D1) > 8. The Travelling Salesperson Problem

8.01 The Travelling Salesperson Problem: An Introduction

8.02 The Travelling Salesperson Problem: Making a Graph Complete

8.03 The Travelling Salesperson Problem: An example of a Hamiltonian Cycle / Tour

8.04 The Travelling Salesperson Problem: The Nearest Neighbour Algorithm

8.05 The Travelling Salesperson Problem: The Lower Bound Algorithm

8.06a The Travelling Salesperson Problem ex2: Nearest Neighbour Algorithm

8.06b The Travelling Salesperson Problem ex2: Lower Bound Algorithm