Travelling Salesman Problem - Upper Bound - Minimum Spanning Tree Method

A quick guide to how to find the Lower Bound for a solution to the Travelling Salesman Problem, using a Minimum Spanning Tree method, from the Decision Maths course. Whilst this is written with the Edexcel 2017 syllabus in mind, it is suitable for other courses. All other algorithms and procedures for the course will have their own videos too. Kruskal's Algorithm: https://youtu.be/Mrb61iGXUFk Playlist for Decision Maths Algorithms and Procedures: https://www.youtube.com/playlist?list=PLZGFjZRj-Fzj4O-lu6EFndzPiukdnVuaU Music: Guy Leroux - You Just Fake It, available from tribeofnoise.com. Please subscribe to my channel for more updates and videos to help you with Maths. If there is a topic you'd like a video on, then please send me a message.