He is better than my faculty who is taking 2 lakh salary .

Studied whole subject topics in a single day from different videos of you sir🥹 Hats off to your explanation❤️😍

Learned from nothing 30 minutes before my exam. I've passed it because of this video. Thanks!

Greetings from germany! I was researching how to solve the knapsack problem and after hours of trying to understand the dynamic approach I came across your video explaining the branch and bound. Very clear and informative!

Highly impressed by your teaching skills sir 💜

I am so very grateful to have found this channel. Very beautiful and clear explanations for these tricky concepts. Sending thanks from Seattle, WA.

very helpful for my exams. Thank you @Abdul Bari Sir

saved my carrer #DAA ...... in a single flow completed all topics #one day batting with full marks thanks a lot sir

You have explained the method very nicely and clearly.

Thank you so much sir... I have been struggling with this knapsack problem for so long... I am grateful to you...

Very well explained..... Perfect in every aspect....

Theres just a small mistake in the formula he wrote. Its not ΣPiXi . Its just ΣPi for both formulas given the condition that the weight

Thank you.so easy method to solve knapsack problem.

thanks a lot sir all the syllabus i have prepared for design and analysis of algorithms for my semester tmmrw i have semester and prepared everything in a great manner only bcoz you sir thanks a lot

sir g you are the best..at least better than my nit professor :)

What an explanation sir 💯 Easy way to understand lengthy problems I am very thankful to you

SUCH A CLEAR EXPLAINATION!!! THANK YOU SO MUCH SIR! 😀

Sir, the way you teach is very nice and understandable.. I'm so glad I found you, and I'm passing in this subject only because of you❤ thank you so so much.

Awesome lecture sir..Thanks a lot ..

Sir it was an excellent explanation.

Thank you so much Sir !! This is videos are really helpfull !🙏🙏

Really ur doing great job....!

M cleared with the concept. Thank u sir...keep posting such videos

Very high teaching skills. Τα δικά μας τα στραβόξυλα στην Ελλάδα θα ήθελαν 300 διαφάνειες και 20 βιβλιογραφικές αναφορές για να εξειδικεύσουν τη γενικότητα και στο τέλος να μη καταλάβει κανένας χριστό και εκείνοι να νιώθουν σπουδαίοι που κανένας δεν κατάλαβε το τόσο υψηλού επιπέδου μάθημα.

Thanks sir for the explaination. However, I am confused why in 0/1 knapsack problem we are considering fractional weight and profit?

Thanks sir.. this ditto question appeared in my exam and got me 20 marks. :)

Sir looks more like corporate big shot trainer. I am not sure but sir could definitely become one of the finest entreprenure in IT. Just a wish !

And the first thing u have to check before starting the sum is that all the profits and weights given should be in non-decreasing order of their profits/weights ratio. If there u can do or else u should sort. It is not required while solving 0/1 knapsack in DP. And at the final your sol vector will be for the sorted set of elements kindly notice it and change it to normal given set of weights.

LOVE YOU ABDUL BHAI TUM BOHAT BADIYA KAAM KARTE HO. DIL SE LOBEEE YOU

what are we comparing the upper bound (which was infinity in the beginning) with U or C in the nodes ? somewhere you are saying compare with U , and somewhere with C ?

Fantastic video my friend!

Thank you for your hard work

TQ SIR u have done lot of favour for us😍😍😍

Mashallah well explained.I am your FAN, Sir.

Abdul, un giorno sarai nei ringraziamenti nella mia tesi di laurea! Abdul, one day you will certainly be on my acknowledgment in my thesis!

thanks for the great video, i learned a new way to solve this problem, what's the time and space complexity to solve this using branch and bound?

Sir your ultimately the best 💥

Very good explanation

sir i need an explain about 0/1 Knapsack using FIFO Branch and Bound solution?

Thank you sir superbly explained ❤️

love from Bangladesh..Sir

What if the cost value comes to be a fraction value? Should we round it off or continue with fraction?

What is the significance of taking the Upper Bound as INFINITY at the beginning ? Can't we instead take this value as ZERO since we are dealing NEGATIVE values ?

thank u so much Sir . U r the best

thanks sir i have cleared my backlogs

Why is it that, no matter the object of the lecture, a random Indian guy is always gonna be there for me to solve my problems? God I love the internet, and India also

Thank u somuch sir for clear information

@Abdul Bari In LC-BB, if there are 2 or more nodes with the same cost, which node should be picked up first for exploration?

Nic explanation sir thank you it help for my semester

Great sir thank you so much

If we have to choose the same object more than once, for optimization - should we multiply the profits and weights of that particular objects appropriately and consider it as a single node ?

Always the objects are sorted in descending order of profit-weight ratio ?

Sir if possible kindly give algorithms for each kind of problem in BnB.Love your vidoes/

Hi, Sir. May I know if the weight capacity remains 1? Can I simply include and add on a fraction value (v/w) from the Item that has a bigger value? Or, based on this method, just find what items are required to choose s={1010} is enough?

Sir, what to do if there is 4 object and after considering 2 object capacity of bag become 1 less than its capacity, Whether to take fraction of only 3rd obj or both 3rd and 4th.

Thank you so much sir 🙏

Could you please let me know that why branch and bound is used only for minimization problems?

grt sir .tanq soo much.

Thank you sir for wonderful explanation! You have explained the Least Count Branch and Bound (LCBB) Can you please upload the video of FIFO for the same as you mentioned in the video somewhere? Please sir its a kind request ! Thank you!

Sir aap bahut punya ka kaam kar rahe hain.🙇‍♂️

Sir pls make a video on nqueens and travelling salesman problem(backtracking) tooo.. #Urgent.. I like the way you teach.. Absolutely perfect!!

Sir at 9:30 when u r including 4th object from node 7, if the weight exceeds 'm' then should we skip the step of adding 4 like the similar way we did at 6th node?

Wow, by this single video i learned the problem clearly...

Whats the need of taking cost in fraction though we r considering 0/1 knapsack?

you are great sir!

Sir should we need sort them before starting the state space diagram

Sir, in knapsack problem we generally sort the values according to the profits and then start adding them to the sack what if we shouldn't consider the last one or something like that.

Sir please make one more video on least cost branch and bound taking one more sum as an example

sir, when you are initially taking the objects weight at 3:18 is there any precedence like taking the objects whose weight is less or it's taken in the order given in the question.

Thanks so much!

Explained better than my faculty

Best Teacher

Sir ! U said that u'll change the -ve values to +ve at last ....where did u done that ?

Sir,whether the weights should be in ascending order or it can be in any order,to solve the problem

On 01 knapsack problem using lc branch and bound please make one more video taking one more sum as an example

sir is it necessary for 0/1 knapsack using branch and bound to be the weights in sorted order

what is the complixity of the algorithm? I mean how much time would it take to find the optimal answer

Can this be written for knapsack-backtracking?

Sir, how to solve this problem by FIFO branch and bound?

Sir while killing the nodes You compared upper bounds with cost ?

thank u sir

Well explained and easy to understand. Thank you so much.

Smooth :)

how can we maximize the value while we have 2 constraints like weight and volume by using branch and bound? :(

How are you deriving cost and upper bound functions?

can we take upper bound as positive integer ?

sir i'm getting confused with the LIFO method of this problem,can u explain me with that

sir for node 3 u=-27 is given in the text book for FIFO of the same problem.so how can i calculate it

Excellent!

Why we are taking upper bound as the smaller value?

Thank you 🙏

sir why after the 3rd node we are taking from x3=0 why not from x3=1

You are love!!!

Why does we can only solve minimization problem in branch and bound?

Thank you theacher. Now I undestand and I believe that I`m able to go ahead with my code. I was wrong about my linear relaxation implementation code

Excellent sir

Sir can u please explain the same knapsack problem using fifo branch and bound.

Life saver.

Excellent

thank you sir