I spent hours looking for some explanation for the reason of choosing the shortest subtours to eliminate and then comes this old video and this great professor explains everything! Thank you very much!

Best explanation I found online. Thanks, Professor!

He is a professor from department of management studies and still explained the algorithm far better than most of the cse professors.

Best and most lucid lecture on TSP ... something I have been searching for 3 days. Thank you very much !

Glad to understand now in 2024 from a video which was posted 14 years ago which such proper explanation. Thank you sir from Germany 🙏🙏🙏

Awesomeness level over 9000. You Sir are too good, explanation much better than the one done by my Prof. at Cal. State University

The entire series of OR is simply fabulous. Easily understandable even by a layman. Thank you so much sir.

Great video, especially from 30:00 onward. Went through every step, with no skipping. Perfect for learning this algorithm.

Loving this tutorial :) Came here just to learn the algorithm. Ended up really interested in the whole concept.

12 year video sorting my issues today, thank you Prof. I have been struggling to understand these theorems for the last 1 week.

I really really like Prof. G.Srinivasan. He enunciates well, provides good examples and he is very accurate. He is also very much talented in teaching. Thanks.

Most of the lectures on this problem were just talking without real results but this one is totaly different thank you for ur offerts

Well done Sir! I have on 2 weeks a Freight Logistics Exam and this vid helped me so much on my preparation, keep going with this magnificent job!! Greets from the Technical University of Munich.

I know next to nothing about math and found this perfectly clear. Wish I had teachers like you when I was in school -- then I probably would know more than nothing about math now.

This guy is a good instructor...he makes a complex mathematical problem seems easy.

The Ui - Uj constraint corresponds to the formulation proposed by Tucker and Miller in 1960. It is defined for i,j >=2....n, and ij. A small mistake, but this guy is awesome.

Thank you sir, from Australia

IIT has the best minds in india. very good lecture

30:40 if any one looking for diff. branch and bound methods for TSP

Hey, he is just trying to find the best paths, he goes in order because it will be easier to work with the table, u will get the same solution if u go 1 to 5 and choose 5 to 2, then 2 to 4 ...... overall u just find the paths the best solution should contain in any order. Hope this answered ur question. Very good video, good job sir.

I never took a book to study or. Your lectures are more than enough to us....... Thank you sir.....

Excellent summary of the TSP and B&B algorithm. Extremely helpful.

thank you for the effort you put on this video. it really is gonna help me alot to perform well in the upcoming exams. I liked the way you clarified the algorithm and you made it look easy.

Really an excellent lecture Sir. thank you so much . the lecture helped me a lot.

Too Good!! Superbly taught! Thank you sOOO much sir!

@24:34 can anyone explain what is 'u_i/j' exactly, in the modified constraint?

Obviously best lecture. Explanation is very clear. Thank you sir.

this guy is BETTER than the english lecturer i have at my university in the algorithms subject and he explains it so damn well. professor you are brilliant and anyone who doesnt understand you is fucking illiterate. this is coming from an aussie!

That's my Don! Enjoying much your lectures.

Absolutely BRILLIANT and GREAT!! So well explained and described!

26:40 How come professor wrote "U5 - U4 + 5

Just one word sir ... Brilliant!!!

The greatest techer of all time!

salute you Sir, you are far far far far better than English profs.

Best Explanation of TSP problem.

Thank you from Ireland

Really good explanation. I am really impressed by his lecture style, very simple and easy to understand.

What an excellent explanation. Thank you so much!!!

Articulate to the max. Straight G of the teaching world.

@chandrataken No, because we have to return to the initial node at the end. So if we start from node1, we have to come back to the same node and hence, 3-1 is not considered as a subtour. Its basically completing the cycle. I hope u got it :)

This video was very helpful... thank you...!

At 26:08, what are these u1 and u2 and u3 and so forth defined as? 28:26, he says its always possible to find u1 and u5 to make that inequality satisfied.

@Sampath Krishnan yes you can do that. But you would have to solve all other branches for solution/elimination anyways. Essentially, you fix one path and find the shortest path based on the remainder matrix. In this respect, the node you start off for evaluation of the remainder matrix is your choice.

Thank you so much for this lecture Professor. Really helpful.

Dear Prof., I show my respect to you!

Thank you very much sir, you have saved me a lot of time in explaining the TSP

@bbbarhas these lectures were given in Indian universities we're lucky they lecture in english

Brilliant teacher

Thank you, Professor. This helped me a lot in my B.Sc. thesis!

Yay! Thank you. This is very helpful since I'm not learning anything from my Algorithm prof...

Thank you so much Sir! You're teaching methodology is awesome ! Regards.

I'd never be able to graduate without his help. Thanks :D!

Awesome!!! Thanks a lot!!!

thankyou keep up the good work sure it is helping loads of people

awesome.. keep it going.learning a lot.

this lecture helped me a lot in my research of TSP

best to learn TSP ,,,thanX for posting this video..

Can someone explain this - after branching off for example from X15 (with cost 31), how is he forming branches to X21, X23, X24? Since X15 is already fixed, shouldn't the next path only be from point 5 which is the destination reached? So the child branches from X15 should only be X52, X53, X54? Similar for X32 and others?

46:30 why it is 33. X13 has assigned than why he consider X31? It must be 34.

Thank you so much for this! You are so much better than my professor at NU who doesn't give a fuck about people who fall behind. Basically, the class asked me go fuck myself, but with your material and all the great wonders of open source, I will jump back. Thanks for giving me the help to get back in the game. Yeah, and I agree with st1ry1ntz...I will be graduating now !!! Hahaa~

Thank you, Professor. Very helpful!

Appreciated Sir .. Thank You . great explanation.

Great tutorial for learners, thanks

According to the wiki of TSP en.wikipedia.org/wiki/Travelling_salesman_problem . In the subtours elimination the i starts from 2. The professor wrote it correectly so now I am able to understand this constraints.

salute sir...u are the best

This is really interesting.

Perfecttttt for any learner!!!!!!

Awesome explanation, too good!!

Thank you sir this video is very help full to me

whoa !! awesome !! great material !

I think when you go through this, you are missing some of the subtour eliminations. For example when 1 - 3 is set, and then 2 - 4 is set, you include 3 -1 in the row minimum summation. But wouldn't 1 - 3, then 3 - 1 be a subtour??

They way it's done, it's hard to implement programmatically

Very helpful. Thank you!

@jack76781 FYI, this lecture was given in one of the IITs, and all lectures in all the IITs are given in English.

Thank you Professor.

int the inequality: Ui -Uj + nXij

excellent.......................!!

"i" is the vertical position in a table and "j" is the horizontal position

You are great!!!

Tqq sir I like u r teaching

very helpful, thanks!

great explaination

why are all this videos about algorithms and stuff like that all from India?

hats off sir...u are damn brilliant

Kudos

Excellent!!!!

Can someone tell me, near 25:00 what is Ui and Uj ？

great lecture.

And the another question is about 49:00. Why there are considered only two edges: 3 - 2 and 3 - 5, whereas 3-4 does not create a subtour? There are made edges: 1-3 and 2-4 Adding edge 3-2 leads to 1-3-2-4, which is ok, adding edge 3-5 leads to 1-3-5, 2-4 which is also ok, adding edge 3-4 leads to 1-3-4-2

in a 5 city problem, there are 4 possible types of sub-tours(st) : loop of 4 cities, 3 cities 2 cities & 1 city. a problem is only completed if all of the cities are visited. so if there is a ST of 4 cities there has to be an ST of 1 city. so by eliminating 1 city ST, the 4-city ST is automatically eliminated. similarly for 3 city ST there has to be 2 single city ST or one 2-city ST.......hence for 5 city prob. eliminating 1 & 2 city ST can ensure elimination of all STs

helped in ca final operations research...thank you :)

thannks a lot sir..!! that was reaalllyy helpful for me :) :)

thanks you sir. Kudos.

brilliant. thank you very much.

What to do when the matrix is not symmetric?

Thank you professor!!!!

Well Explained!!!

thank you so much for the class

excellent thank you very much

marvellous