Lecture series on Advanced Operations Research by Prof. G.Srinivasan, Department of Management Studies, IIT Madras. For more details on NPTEL visit nptel.iitm.ac.in
Пікірлер: 212
@guicarboneti2 жыл бұрын
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!
@paramshah1349 Жыл бұрын
What is the explanation that you found, can you explain pls?
@zhuoyunjin447610 жыл бұрын
Best explanation I found online. Thanks, Professor!
@stevenson7204 жыл бұрын
Yep. This guys great.
@noorulsaba91793 жыл бұрын
Totally agree.
@jagdishtilokani25313 жыл бұрын
He is a professor from department of management studies and still explained the algorithm far better than most of the cse professors.
@maker72460 Жыл бұрын
Management people use optimization methods a lot!
@yashthedreamer13 жыл бұрын
Best and most lucid lecture on TSP ... something I have been searching for 3 days. Thank you very much !
@SanjayKonaecarАй бұрын
Glad to understand now in 2024 from a video which was posted 14 years ago which such proper explanation. Thank you sir from Germany 🙏🙏🙏
@sumithaswar49010 жыл бұрын
Awesomeness level over 9000. You Sir are too good, explanation much better than the one done by my Prof. at Cal. State University
@yshasft14 жыл бұрын
The entire series of OR is simply fabulous. Easily understandable even by a layman. Thank you so much sir.
@davidhand83376 жыл бұрын
Great video, especially from 30:00 onward. Went through every step, with no skipping. Perfect for learning this algorithm.
@amiththomas38849 жыл бұрын
Loving this tutorial :) Came here just to learn the algorithm. Ended up really interested in the whole concept.
@kelvinkoiser Жыл бұрын
12 year video sorting my issues today, thank you Prof. I have been struggling to understand these theorems for the last 1 week.
@mosyemessy12 жыл бұрын
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.
@user-wt9xo5ys1m5 жыл бұрын
Most of the lectures on this problem were just talking without real results but this one is totaly different thank you for ur offerts
@Joshmaradomx12 жыл бұрын
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.
@Dave-lr2wo7 жыл бұрын
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.
@clloydmathison9956 жыл бұрын
This guy is a good instructor...he makes a complex mathematical problem seems easy.
@productionnet22427 жыл бұрын
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.
@brucenguyen526410 жыл бұрын
Thank you sir, from Australia
@Mbc43m2767 жыл бұрын
IIT has the best minds in india. very good lecture
@lohitchinthala78867 жыл бұрын
30:40 if any one looking for diff. branch and bound methods for TSP
@janicklasralphjames917911 жыл бұрын
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.
@ROHITGR7212 жыл бұрын
I never took a book to study or. Your lectures are more than enough to us....... Thank you sir.....
@zaacymay9 жыл бұрын
Excellent summary of the TSP and B&B algorithm. Extremely helpful.
@MaxammedBile10 жыл бұрын
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.
@keerthanaashok68848 жыл бұрын
Really an excellent lecture Sir. thank you so much . the lecture helped me a lot.
@siddhartharao14849 жыл бұрын
Too Good!! Superbly taught! Thank you sOOO much sir!
@vijeta2686 жыл бұрын
@24:34 can anyone explain what is 'u_i/j' exactly, in the modified constraint?
@md.sabbirahmed90296 жыл бұрын
Obviously best lecture. Explanation is very clear. Thank you sir.
@happinin13 жыл бұрын
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!
@elishaayoo36896 жыл бұрын
That's my Don! Enjoying much your lectures.
@TheFusEE14 жыл бұрын
Absolutely BRILLIANT and GREAT!! So well explained and described!
@divyanshujhawar36715 жыл бұрын
26:40 How come professor wrote "U5 - U4 + 5
@rohitkalra99814 жыл бұрын
yeah, same ques
@crazypanther110 жыл бұрын
Just one word sir ... Brilliant!!!
@Lostpanda12314 жыл бұрын
The greatest techer of all time!
@PremRajasekaran13 жыл бұрын
salute you Sir, you are far far far far better than English profs.
@aayushkapadia44915 жыл бұрын
Best Explanation of TSP problem.
@stevenson7204 жыл бұрын
Thank you from Ireland
@noorulsaba91793 жыл бұрын
Really good explanation. I am really impressed by his lecture style, very simple and easy to understand.
@datdang50422 жыл бұрын
Do you know how to work it out in excel ?
@johnward92552 жыл бұрын
What an excellent explanation. Thank you so much!!!
@yourmomlikesmeinbed12 жыл бұрын
Articulate to the max. Straight G of the teaching world.
@TheViniArya13 жыл бұрын
@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 :)
@dhanashreenemade30098 жыл бұрын
This video was very helpful... thank you...!
@timpanitimptim11 жыл бұрын
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.
@galluer10 жыл бұрын
@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.
@milenavuk2 жыл бұрын
Thank you so much for this lecture Professor. Really helpful.
@Devina051411 жыл бұрын
Dear Prof., I show my respect to you!
@kagisomokena714010 жыл бұрын
Thank you very much sir, you have saved me a lot of time in explaining the TSP
@jack7678113 жыл бұрын
@bbbarhas these lectures were given in Indian universities we're lucky they lecture in english
@shubhamthapliyal9885 жыл бұрын
Brilliant teacher
@romzen7 жыл бұрын
Thank you, Professor. This helped me a lot in my B.Sc. thesis!
@geraldomouramoura27816 жыл бұрын
romzen 🐬
@kakorckaact0713 жыл бұрын
Yay! Thank you. This is very helpful since I'm not learning anything from my Algorithm prof...
@VishnuBJanga9 жыл бұрын
Thank you so much Sir! You're teaching methodology is awesome ! Regards.
@st1ry1ntz11 жыл бұрын
I'd never be able to graduate without his help. Thanks :D!
@vitoriaheliane72383 жыл бұрын
Awesome!!! Thanks a lot!!!
@lechiman0114 жыл бұрын
thankyou keep up the good work sure it is helping loads of people
@johnyepthomi8923 жыл бұрын
awesome.. keep it going.learning a lot.
@lucellenaidoo71947 жыл бұрын
this lecture helped me a lot in my research of TSP
@datdang50422 жыл бұрын
Do you know how to work it out in excel ?
@mittijoshi13 жыл бұрын
best to learn TSP ,,,thanX for posting this video..
@samkris608910 жыл бұрын
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?
@ArunDevKaushik6 жыл бұрын
46:30 why it is 33. X13 has assigned than why he consider X31? It must be 34.
@shikhar28113 жыл бұрын
You are right i also had the same doubt.
@jkantrance20211 жыл бұрын
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~
@ChitStarkid947 жыл бұрын
Thank you, Professor. Very helpful!
@kousarmuskan49796 жыл бұрын
Appreciated Sir .. Thank You . great explanation.
@jacobli26767 жыл бұрын
Great tutorial for learners, thanks
@raziebe7 жыл бұрын
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.
@ANAYKhairatkar12 жыл бұрын
salute sir...u are the best
@DOMINICTSONGO8 жыл бұрын
This is really interesting.
@daizybhadresha51679 жыл бұрын
Perfecttttt for any learner!!!!!!
@alexantosh9 жыл бұрын
Daizy Bhadresha hi, what does U stand for in the Ui -Uj + nXij
@parthaghosh97511 жыл бұрын
Awesome explanation, too good!!
@ankurmishra54638 жыл бұрын
Thank you sir this video is very help full to me
@adg76412 жыл бұрын
whoa !! awesome !! great material !
@chandrataken13 жыл бұрын
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??
@pushkar------49204 жыл бұрын
Hiii
@ChiragRajputS5 жыл бұрын
They way it's done, it's hard to implement programmatically
@programm.r8 жыл бұрын
Very helpful. Thank you!
@troff1513 жыл бұрын
@jack76781 FYI, this lecture was given in one of the IITs, and all lectures in all the IITs are given in English.
@Psycheoflame10 жыл бұрын
Thank you Professor.
@alexantosh9 жыл бұрын
int the inequality: Ui -Uj + nXij
@nickyouyang37239 жыл бұрын
alexantosh it's an artificial variable
@bobbeeez12 жыл бұрын
excellent.......................!!
@WeslleyCXS11 жыл бұрын
"i" is the vertical position in a table and "j" is the horizontal position
@carolaosorio50154 жыл бұрын
You are great!!!
@chinthaladivyasree48166 жыл бұрын
Tqq sir I like u r teaching
@yinengwu89275 жыл бұрын
very helpful, thanks!
@SonuSonu-tk5pk7 жыл бұрын
great explaination
@CamiloSanchez197911 жыл бұрын
why are all this videos about algorithms and stuff like that all from India?
@tppt39874 жыл бұрын
Wdym??
@islamamaize62984 жыл бұрын
@@tppt3987 why are you so butthurt abt it?
@stevenson7204 жыл бұрын
Because the indians are big into stem and realized how useful, especially in a poor country teaching this way is. No university campus required.
@AkshayKumar-wu8fc3 жыл бұрын
@@stevenson720 Do you know what the population of our students in colleges or school may be double or triple of your total population.
@AkshayKumar-wu8fc3 жыл бұрын
@@stevenson720 there were over 2.6 million primary school teachers in India. Then you think about it how many students are in India.
@sanketpatel850411 жыл бұрын
hats off sir...u are damn brilliant
@shubhamboy13 жыл бұрын
Kudos
@MoutsKla14 жыл бұрын
Excellent!!!!
@OscarZhang199011 жыл бұрын
Can someone tell me, near 25:00 what is Ui and Uj ?
@emmanuelkwarirandunda75926 жыл бұрын
great lecture.
@olgapawlowicz62329 жыл бұрын
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
@abhaymathur534211 жыл бұрын
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
@datdang50422 жыл бұрын
Do you know how to work it out in excel ?
@geniusvincy8 жыл бұрын
helped in ca final operations research...thank you :)
@sagnik19917 жыл бұрын
true. am using this video as well. same is not available in sanjay agarwals video.
@gkthakral11 жыл бұрын
thannks a lot sir..!! that was reaalllyy helpful for me :) :)