4.7 Traveling Salesperson Problem - Dynamic Programming
HTML-код
- Опубликовано: 21 фев 2018
- 4.7 Traveling Salesman Problem - Dyn Prog -Explained using Formula
• 4.7 [New] Traveling Sa...
CORRECTION: while writing level 3 values, mistakenly I wrote 4 level values
Travelling Salesperson problem is solved using Brute Force approach and Dynamic Programming
PATREON : www.patreon.com/bePatron?u=20...
Courses on Udemy
================
Java Programming
www.udemy.com/course/java-se-...
Data Structures using C and C++
www.udemy.com/course/datastru...
C++ Programming
www.udemy.com/course/cpp-deep...
![4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula](http://i.ytimg.com/vi/Q4zHb-Swzro/mqdefault.jpg)
Tomorrow DAA exam very Thanks 😊
Lol 😂. It's my turn now
Today DAA exam in 1 hr😌
@@AMAN-dt9ry haha now it's my turn👻
@@Xingalaxy Army💜🤣
Mine too 🤝
And mine is today after 1 hour 🙃🙂
There was a mistake from g(2, {4}) to g(4, {4})..The solutions are g(2, {4}) = 18, g(3, {2}) = 18, g(3, {4}) = 20, g(4, {2}) = 13, g(4, {3}) = 15
👍
Yeah!, I was thinking the same thing.
@@abdul_bari No problem. Your students can easily overcome minor mistakes. At the end of the day " we are your student ".
thanks bhai i was confused with this one
Yes i also noticed
For those wondering what makes this a DP solution:
Basically instead of finding all permutations. and then doing the arithmetic, IE, instead of doing min(1->2->3->4, 1->2->4->3, ...) of all possible routes, we can see that there are repetitive calculations in 1->2->3->4 and 1->2->4->3 for instance. The route 1->2 is common(overlap) to routes 1->2->3->4 and 1->2->4->3, if you looked at the tree closely.
By definition of DP, we are trying all possibilities and we also see overlapping subproblems!
thank you
@vendettaaaa666 So essentially all this is, is caching distances into a giant lookup table? That still seems very complexity-demanding to solve this problem.
@@kevintyrrell7409 it is NP-Hard afterall
@@kevintyrrell7409 at least we're eliminating the computational redundancy while reaching each possibility
I think we are overlapping because we don't know from which direction path cost is minimum. If both sided path would be same then that approach will not be more good.
Simply outstanding! Doesn't get better than this.
Our college teachers became teachers because they didn't get placement 😀 . and this person became teacher because of his interest. The difference can be seen 😁 clearly
Sir, you are a great teacher . Your explanation is excellent . wish you all the best and you live long with sound health . Thanks.
thank you sir finally I understand how to solve this types of problem ....😊
The way of teaching is like bottom up approach - first solve , then derive algorithm !
Great videos - all of them : )
You the best in explaining these tough algorithms in an layman language. Thank you sir!!
ruclips.net/video/K3rYJYi2geE/видео.html
He is teaching for the sake of TEACHING..and unlike others not asking for Like, Share And Subscribe 🙏🙏🙏🙏
If someone asks for like, share and Subscribe, there's nothing wrong. They need to fill their stomach to actually teach. Really D*m* take by you.
I think you mean love. Sake usually implies he's doing it because he has to not because he wants to.
also incorrectly
Sir
one thing I've to tell you !
Watched all of your videos for 3 times or atleast 2 times perfectly
and It's just because of you , today I was confidently able to write the DAA Exam under JNTU-H
Thank You so much Sir !
Really lovely explantions !
and I hope you create some more videos on other Computer Subjects
Sir , you were known to whole of our College and you were the one who have helped almost 450 students in our college
Once again Hats Off to you Sir !
NOT ONLY YOUR COLLEGE!
HE IS HELPFULL FOR EVERY COLLEGE STUDENT PURSUING BTECH IN CSE.
pass hua?
Teacher is at another level 🤩👏🏼 now I can do it on my own..thank you sir
You make the subject very easy sir.
Thank you so much.
You are
doing a great help to students like us sir... huge repect
Thank you sir understood this very clearly. Except for that small mistake of g(2,{4}) everything is explained well and fine. ⚡
Best explanation i've seen.
11:23 forward has some mistakes, but thanks for the video. I kinda understand
You know you will top when sir abdul bari is there. Thx sir
Sir your videos are too good and easy to understand... I studied from your algorithm Playlist only... You're a saviour... Thanks a ton!!!
Great explanations!!
thank you sir.
Awesome sir.....I'm in DAA semester exam's previous day, I'm blank about DAA, but after seen your all videos I'm very much cleared and having hope i will pass in exam👏👏👏👏👏 Hat's of sirG
did you pass? I have DAA tomorrow, asking for a friend
@@nanduugee I have daa exam tomorrow what should do. To pass
@@nanduugee there is no waY TO pass by watching his video, i got failed , i had watched his video 100 times but still not cleared
Thank u ji.. For helping before exam day..❤❤nice teaching skills saab
Profesor Bari, you surprise me all the time, are you Magic? i have just come from another video and i could not understand what he was saying but within the first two minutes and 30 seconds here i already understand the problem... thank you
Sir wonderful explaination.hats off sir😍😍
Your lectures helped me to pass in my examinations 🙏
nee thooti potti machu
This Channel deserves more subscribers and views
Great explanation! Thx!
Watching this a night before ADA exam . Wish me luck
Abdul Sir you are the best! 🙏🏽
Great Videos Sir!! Really helps a lot.
very good! thorough explanation
This is extremely useful. Thanks a lot!
Thanks slot sir I really feel very happy after seeing u r videos it's really awesome I learned alot tqqqqqqqqq so Much
Thank you sir i gave exam today for algorithm and my exam was good thnx to you
Sir as you took g(2, {3}) =15 then all the remaining will be also like same..... But you wrote g(2, {4}) =8 it will be 18 na, and g(3, {2}) =5 but 18....g(3, {4}) =20, g(4, {2}) =13, g(4, {3}) =15.....na?
Yes bro , he had written wrong
I was also confused
All are saying well explained sir but one is observing the mistakes
Simple and easy explanation nice 😊we are easily understanding u r simply way ☺️
Sir you are great sir, this help me lot in #DAA exam 🙏🙏🔥
Bahut acche se samaj me aaya sir... Thank you...
I think there is mistake in this problem sir, but the way you teaching students can easily find that error😍
MashaAllah beautifully explained sir. Thanks for uploading such a great lecture.
#Balochistan
praise to mulla allah
@@baal1297 I didn't get.
i was searching for this nice explaination
Best algorithms lecture
Nice explanation sir
Can you please make some videos on in depth explanation on making these general dp formulas and determining if we can apply dp in a particular problem?
Well understood by this video
Great ......
Masha Allah your teaching very nice sir...,
Even my subject faculty is watching your videos to take classes for us sir😂😂
sir i love your teaching method
No one is perfect , but that mistake screwed up my solution.... Well i found a helpful guy who gave the correct values...
Guys like me will get into depression if our answers don't match, so thanks to that guy....
I should have watched this in regular of my examination 😩
Now I can pass my exam 😃
The best teacher in the world
Thanks a lot for these wonderful videos.
You have very nice voice. It makes listening to you more enjoyable.
Sir please make video on longest common subsequence
much helpful....thanks sir.
Really nice explanation sir.
Really understandable.
Very excellent thank you your valuable team
Our teachers are watches your videos sir before teaching a lecture
great explanation but it could have been awsome if algorithm would have explained with any code (C/C++)
thank yoou so much sir you make feel like a superman
Nice work with cool explaination
Excellent teaching ❤
awesome way to explain
Thank you sir for wonderful explanation
thanks alot. it was so helpful🙏🏻🙏🏻🙏🏻
Awesome teaching
You saved me !!
Sir u r teaching very useful for me tq so much and this TSP it has 1 small mistake g(2,{3} )=15 but g(2,{4})=18, g(3,{2})=18and so on... But u just consider only 1vetex only that is mistake
Jazak Allaahu khair...
Tomorrow DAA exam....my DAA mam is a waste...thought me nothing but how to pluck the hair........thankyou for explaining sir
Sir, promise me you'll never delete these videos! These are great for references even when I'm 30
Edit: We have exam tomorrow with students of about 20sec*60 = 1200 students watch your videos this entire day like me :-)
gitam,visakhapatnam sir..
@@pranavigogireddy9859 here you go!! Told you there will many people watching it.. 2 out of 1200
Today is my in evening and I'll watching this I the morning ❤
I dont understand can you repeat
Great video sir
This is morning 5 am and today is daa exam but I'm ok daa easy and his lectures are very useful ❤😊
U teach very well sir no doubt ...bt best thing what i found is tha u take examples from text book ...it makes very easy to understand us the concept
Thank you so much Sir,
NICE SUPER EXCELLENT MOTIVATED
So this is pretty much the same as the multistage graph problem? The algorithm starts finding out minimum costs from the end towards the starting point. The only difference is instead of having a table saving the shortest path to the next node, we have have all the combinations as some sort of list
you are making it from hard way
Good explanation thank you sir
Sir . So clear explanation . One doubt I have is in the formula you have used - {K}. Can you explain that with an example which has to be subtracted.
Thank You So Much Sir..nice explanation SIr!!!
Haslee - free .... U blessed me
Can you make a video on inventory transshipment problem for individual retailers in the system ?
Great lecture
Please add video on travelling salesman using Branch and Bound method
Thank you so much sir
Thank you sir....
Thanks This is cool
I'm pass this exam tq soo much sir 👏😍
simply awesome
Great!!!
Tq sir I cleared my subject
Tomorrow is college exam very thank you.
Akgec....
Hello,
I just saw your video on travelling sales man problem. I had another problem that is similar to this one, however we have the revenue at each location on a certain day and we want to travel through any combination of cities to figure out the maximum revenue possible. Do you have any suggestions on how I could solve this?
Thank you teacher
Thank u sir!!
why dont you publish a book? awesome teaching
You should explain time complexity with the help of algorithm. Overall it's was very good.
Ris Ab Agreed
its on the order of n!
사랑한다 선생님
sir u messed up near the intermediate part where there is 1 remaining vertex as in ... g(2,{3}) ..... to ..... g(4,{3}) ....
but it is a good explanation ... thank you