Travelling Salesman Problem -Upper Bound

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

https://youtu.be/xN9ZtYzPewg

$2.63
Save for later
  • Minimum-Spanning-Tree-Upper-Bound.pptx

About this resource

Info

Created: Oct 8, 2019

Updated: Jan 9, 2020

pptx, 48 KB

Minimum-Spanning-Tree-Upper-Bound

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?