The Travelling Salesman Problem (Edexcel A-Level Further Mathematics): Quizzes

Find the shortest route visiting all vertices exactly once and returning to start

Complete graph

Weight of $(A \to C) \leq$ Weight of $(A \to B) +$ Weight of $(B \to C)$

Infinity ($\infty$)

An upper bound for the minimum route

Nearest unvisited vertex

Heavily influenced by starting vertex

Hamiltonian cycle with minimum total weight

Shortcuts replacing route segments

Not trying different starting vertices