A-level Mathematics/OCR/D1/Node Graphs/Travelling Salesperson Problem

From Wikibooks, open books for an open world
Jump to navigation Jump to search

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'


This page or section is an undeveloped draft or outline.
You can help to develop the work, or you can ask for assistance in the project room.
Retrieved from "https://en.wikibooks.org/w/index.php?title=A-level_Mathematics/OCR/D1/Node_Graphs/Travelling_Salesperson_Problem&oldid=3249490"