411 REFERENCE · Wikibooks
A-level Mathematics/OCR/D1/Node Graphs/Travelling Salesperson Problem
Reference material by Wikibooks contributors. This retains its source identity and is not 411 news reporting.
The Travelling Salesperson (split into Upper and Lower Bound algorithms) requires that one visits each node at least once and returns to the start node in a 'Hamiltonian Cycle'
Node Graphs/Travelling Salesperson Problem