Algorithms for the Traveling Salesman Problem

This video deals with the history of the Traveling Salesman Problem and different algorithms pertaining to this problem.
Handout:
drive.google.com/uc?export=do...
Music: Lyfto - High

[@GurpreetSingh-pr5ei]

remove background music pls

[@dhaigh01]

Great video! Point of feedback: consider removing the background music. It is distracting and makes it difficult to hear the lecturer, at times.

[@NoBigDealMedia]

God I really wanna keep watching but this dude perfect music made me write this comment and leave

[@anabelsa]

This is probably the best explanation I have been able to find about the TSP but the content is totally spoiled by the background music.

[@giahaasbroek4717]

really clear ;)

[@ianmorrisnieves8537]

I think your claim at 3:54 is not correct. It is *not* easy to find the cheapest tour. It is only easy to verify that you have a valid tour and that that tour is greater than or less than some value. To find the cheapest tour you have to enumerate all tours brute force in the worst case.

[@johnjohnson5814]

0:40 When you say "no effective solution is known for the general case," I think that is a bit misleading. There are no polynomial time effective solutions for the general case, but there are, however, factorial and exponential time algorithms that are guaranteed to produce correct results in the general case.
7:40 You claim that the algorithm shown runs in "exponential time," but I think you mean "factorial time". (n-1)!/2 is factorial. There is, however, an exponential time algorithm that was introduced by Richard Bellman in the 60's that runs in O(n^2 * 2^n) time

[@KoushaChangiziAshtiani]

seriously, who puts music on a math video?

[@mihavatovec337]

Just fix the music,the tone of voice is to low.
But anyway its still great video

[@yrezzak]

nevermind, not even a good video. ur moves are weak