I'm helping my daughter do her homework during the Covid-19 lockdown and this is the clearest description of branch and bound that I have seen. I looked at several websites and videos. Thank you for your help!

Heyy... The timing is 2:49 am. Today is my exam on 10 o'clock.😅 I read some comments that they have their exams on the day they saw this video. So I just want share this 😁 That I'm also seeing this video on my exam day . ☘️🙃🏝️ Hope that my exam will go well🤞🏻.......

Sir you are the best...infact my class teacher teaching in the class after watching your video's lecture 😊

Abdul Bari, I've been watching a couple of your videos to cram for my final and you're incredibly helpful. I give my most gratuitous thank you.

Watched all your KZfaq videos from scratch. Teaching in that way, which is simple to understand and will also be quickly absorbed by the students is an ART. You have got this brilliant ART sir. I have grasped all these concepts before college via your videos. Thanks a lot for providing knowledge for free. You are a real teacher and i hope that you will continue teaching us more through your videos.

I had my DAA exam today, and I am pretty sure that I am going to top this one. The same question came in my exam today for a whopping 18 marks! Thanks, Abdul Bari Sir for giving us the support the college couldn't give. 😊😊

This is so extremely well done. I can’t thank you enough for sharing this in such a well detailed manner. You’re a gifted teacher.

sir i couldn't attend any of the daa lectures at my college due to an internship and every lecture you've taken is a treasure!..my orals went amazing thanks to the way you clear fundamentals and I'm feeling more confident for my finals too! Thank you so much sir!

Tnk u very much Sir Your explanation way is very clear & awesome👌

Hello Sir, You explained it really well and made an "NP" hard problem just a cake walk.

I'm so happy that I just entered the university last year. Imagine entering university without this video, I would be dead inside

I've been referring your videos to most the topic from my syllabus. I could able to cover 4 units out of 5 units which is like "I'm going to get 80/100 for sure in my final exam". Thank you so much sir !

If you have habit of reading comment before watching any teaching video like me to know if the video have positive comments or if it worth to watch, then you don't need to come to comment section before watching Abdul sir's video, this sir has the best explanation of DSA topics on the whole KZfaq.. Come here after watching the full video to appreciate his excellent teaching skills..

Sir, you're great so blessed to study this from you... I would like to tell you that, I seriously don't know anything about this, but... I saw your lecture and I seriously understood.! hats off to you sir.!

Sir I am from SRM university . ALL YOUR videos have been really helpful and have scored good marks in my algorithm paper . Thank you once again sir

Hello Dear sir! i am from afghanistan studying in a private university in india i just wanna say thanks to you,your teaching method is excellent . Thanks sir

Thanks a lot . What i have learnt ever ,almost 90% algorithms from you

Thank you so much. Great explanation and very easy to understand. :)

Sir,wondered how ur teaching is so perfect and clear...!!😊

Thank q for your DAA lecture sir your are helping directly with your knowledge ....

superb explanation great work sir !!! Masha Allah

You saved my semester! Thanks a ton. 😊

I thank God every single day for your existence. You are a massive help to university students in Indonesia.

Thank u for such an explanation I have seen your videos before a day of my exam kudos! We are paying hefty fees structure to the college's nothing else.useless teachers like a worm who is eating our hard earned money.

you're the best sir i literally can't survive this semester if it weren't for you thank you so much

WOW, that was an amazing illustration. Thanks Bari!

Thanks a lot sir Because of lectures I was Able to clear my daa and toc papers . For daa I t took me 3 attempts and for tocit took me 5 attempts.

You are a blessing to us students Sir. I had to pause your video several times and check. This was great Sir. I pray to God that our faculty too teaches us in the same way that you do Sir.

your teaching experience and knowledge is awesome. thanku you sir

Very good explanation. Many thanks. Helps alot when you study AI.

Seriously Abdul, this is fantastic quality instruction. My only feedback - the audio is a bit difficult at times. I would consider upgrading your microphone. Do that, and I can see a lot more people consuming your content.

Very simple and nice explanation. Thank you so much 😊

Thanks sir. you explain much better than my professor.

Thanks sir, this video helps me alot! :D

Would've spent hours on this topic if I read the theory alone 😇thank you sir

I think there is an error for the Node6(2) to Node10(5), it should have a remained cost for 11, the true cost should be C(2,5) + Cost(Node6) + ReducedCost(place(5,1)) = 0 + 28 + 11 = 39

Question, should we run the algorithm from all 5 nodes, to confirm that it is in fact minimal distance? And is there a way to better choose starting node?

Tq you very much sir, this way was very easy and understanding also. 🙏🙏🙏🙏🙏🙏

Sir thanks a lot for ur videos...I can't thank u enuf for clearing all these concepts in such a v easy way

Great Job Keep at all your amazing teaching sir

Sir, is there a basis for comparison, performance-wise, between the Traveling Salesman Problem or 8 Queens Problem? I want to know if using Backtracking is better than Branch-&-Bound, or vice-versa. Does one approach lead to less number of computations? If so, by how much is the computation reduced? Or is it that in specific cases, like in 8 Queens Problem, it is better to use Backtracking, because it relates to a constraint, that no Queen should be able to kill the other, whereas in Traveling Salesman Problem, the main objective is to minimize the cost, under the given function, whereas there's no such cost function in the case of 8 Queens?

Thank for your lectures , helped me lot to pass my exam

Sir I have my exam tomorrow of Design and Analysis of Algorithms , i must say you are such a great help for clearing concepts and doubts,at most of the places i refer to you not books. At some places you have told methods and explained but algorithm are missing. Thanks alot. May God Bless you.

Sir, You are explaining the concepts in a unique way so that we can easily understand thank you so much. one doubt sir, what is the upper bound condition for TSP if we solve the problem by FIFO branch and bound.In FIFO we have to expand all the nodes till leaf then update the upper bound ? we have to find all possible solutions till reaching the leaf node then the problem ll be similar to back tracking ?

Thank you very much Sir..Your way of teaching is just fabulous and very understandable keep it up sir .

Thank you so much sir this video is very useful to me and ur teaching style is very nice and it is used easily understand

I have completed all your 3 courses on udemy and now I have been eagerly looking forward for new one.

very clear way of teaching and excellent explanation skills

For travelling from node 1 to node 2, row 1 and column 2 are set to infinity because after that node 1 cannot travel to any other node and no other node can travel to node 2. Am I thinking right, or there is something more to it?

Thank you for the lectures.. it's superb...

Thanks sir you helped a lot for my daa exam

Thanks for this great lecture sir helped a lot !!😊

With all due respect Sir, if the cost from 3 to 1 is very very large and if return path to node 1 not considered (as leaf node), will it still give optimal result?

Watching your video before having a lecture at my university really help me much Thank you so much, sir!

The most exhausting Mr. Bari video ever LoL

Thank you so much sir..Your lectures helped me a lot in learning concepts

thank you! it's very easy to understand!

You are best. The only treasure I found for my exam DAA

Good way of explaining. Thank you

Sir I've understood why should we place infinity in the matrix (i.e destroying the path so as to prevent the closed loop formation) But sir may I know why the matrix is to be reduced(i.e ensuring zero in every row and column)

sir How can we solve for undirected graph if matrice is not given. how to construct matrice. please help

Really very easy explanation. Thank you so much🙏

Thank you so much Sir..Can you upload the videos of flow shop scheduling?

Thank u so much such..becze ur explained this topic is very clearly ND easy to understand .......

I wonder why my professor taught me wrong and made so many mistakes ,now i am learning from this video.Thank you sir

Very good explanation. Thank you so much sir.

Thanks for not skipping any steps!

Thank you so much sir....you are great ☺️😊...

sir poora paper hi bata dia aapne to. mai bhi tha namu ke sath iska comment neeche hi hogga. zabardast ek dum sir thank you

The Best and the clear explanation sir...Thank you so much for this video sir...😊😊😊😊

Sir , If we find two node with same value , then which node should we explore ?

We are blessed to have you sir.

At 3:12, you mentioned "depth-first search, right preorder." Wouldn't it be left preorder since you're processing left-to-right?

Hello, Sir, thx for your video! But I think we should add the cost from 3-1 at last, because the saleman must go back to the first city, so the right answer is 28+3=31, right?

Sir, can you please upload videos on applications of max flow problem..airline crew scheduling and other applications.

Liked the term "Travelling salesperson problem" instead of salesman. Awesome explanation too. Thanks

Very useful and clear explantation! A lot of thanks.

Sir, if in case node 8 is having least cost than node 10 after exploration of node 6.. either we have to continue with node 10 or node 8 by leaving the expanded parent node

Thank you so much sir. You taught this so well

thankyou sir. so helpful for my thesis!

Sir i have a question what if the rules 3 and minimum is 6, will the result go for -3 or just zero (0)

You are amazing !! Thank you for making it so simple yet understandable!

In node 6 the path is from 4->2 you changed 4th row and 2nd column to infinity and 2->1 to infinity. Why you did not changed 2->4 to infinity?? and please reply

Hello @Abdul Bari, This tutorial has been truly enlightening to say the least. I have three observations that I have noted down based on the various strategies that you taught us on in this tutorial series. Request your/viewer's thoughts on the following: - All Optimization Problems have a given constraint also. Can there be optimization problems without a constraint? - The "feasibility function" checks the constraint in the Greedy Approach. Likewise the "bounding function" checks the constraint in B&B and Backtracking. - DP, B&B and Backtracking all basically resort to "efficiently designed" Brute Force method. This could give me an overarching clarity.

sir, what if the graph is the directed graph and doesn't have the access to the remaining unvisited vertex. could I take the minimum value of unvisited vertex from the visited vertex that granted access to that unvisited ?

Bro is carrying my cs major

Thank you so much sir, really helpful video. God bless you😊

hello sir, thank you so much for creating this video. it is very helpful. could you please make a video for solving binary integer programming problem with Balas' additive algorithm?

I just watch these videos and bunk the class of DAA. Sir you are great and sir please make video on Cook's theorem.

Sir should node 5 be connected to node 1 directly in the state space diagram?

Thank you so much sir, very clear explanation :)

Hi I really enjoyed this class, it is very explanatory. What is the name of this relaxation? Lagrangian relaxation? Thank you

Simply amazing !! Thank you sir (Y) :)

Thanks a lot, for all the videos!

Hello sir, please how do we continue if the initial matrix has already been reduced?

Tum kya mast kaam karte ho Bari bhau! 🎉🙏

what is the time complexity for TSP problem using branch and bound?

Amazing lecture sir!!

its really very very best teaching that i need not to revise this topic again by listing once its very clear and very clarity Thankyou sir

Great explanation.. cheer's