7.2 0/1 Knapsack using Branch and Bound

0/1 Knapsack using Branch and Bound

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming

[sriramkanisetty]

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

[mikewal-ente]

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!

[shivamelody]

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

[MPKiller]

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

[shul]

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

[jackiep]

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

[vikrampareek]

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

[letscode]

Highly impressed by your teaching skills sir 💜

[nafizbasaran]

Great explanation professor thanks. Something is not mentioned in the video but I'm pretty sure about it. Before the process, we should sort profits & weight arrays according to profit / weight ratio like in the example since we are considering partial contribution.

[nicky]

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

[kavyaramamurthy]

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.

[ΜιχάληςΜιχαήλ-σν]

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

[Sameer-jvvx]

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

[sergioaugustoangelini]

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

[mark]

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

[mohdAbdulRahman]

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

[parameshwaran]

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 <m .He substituted the values right but the the formula was a bit off.

[erickgomez]

I'm a time traveler from the year 3000. I came to this era to watch this video. In the future someone spilled coffee on the youtube server and this video was lost for good. Thank you, Sir. Now I con back to my time and continue packing for my trip to Jupyter.

[nikhilgodbole]

You have explained the method very nicely and clearly.

[MuraliKrishna-utir]

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.