Rating is available when the video has been rented.
This feature is not available right now. Please try again later.
Published on May 30, 2012
A short tutorial on finding intervals for optimal routes, using nearest neighbour for upper bounds and using minimum spanning trees to find lower bounds for optimal routes. This is part 3 of 3 in a series of tutorials on the Travelling Saleman Problem
Keep updated with all examination walk throughs and tutorials via www.twitter.com/mathormaths and www.facebook.com/mathmathsmathematics