Travelling Salesman Problem -Lower Bound

The Powerpoint shows how to use the minimum spanning tree method to find a lower bound for the Travelling Salesman Problem. There is a video showing its use available at the address below:

Save for later
  • Minimum-Spanning-Tree-Lower-Bound.pptx

About this resource


Created: Oct 8, 2019

Updated: Jan 9, 2020

pptx, 54 KB


Report a problem

Get this resource as part of a bundle and save up to 29%

Tes Paid Licence

How can I re-use this?