0/1 Knapsack Problem using Least Cost Branch and Bound ( LCBB ) || Design and Analysis of Algorithms

#sudhakaratchala #daavideos #daaplaylist
In 0/1 knapsack problem. We define upper(the global variable) and c’(x) and u(x) for each node.
c’(x) is the used to find the cost of the node(or effort) starting from the root.
In 0/1 knapsack c’(x) means the maximum profit at that node(with fractions ).
u(x) is used to find an improved upper bound value.
In 0/1 knapsack u(x) means the maximum profit at that node (without fractions).
After the E-node is expanded
It generates a list of live nodes
c’(x) and u(x) is calculated for each generated live node.
If an improved u(x) is generated for any newly generated live node then, update upper to u(x).
Kill the nodes whose c’(x) is greater than upper(updated)
The selection of next E-node is depends on the approach used.
LC BB - selects whose live nodes cost is least
FIFO BB - selects from next live node from the queue
LIFO BB- selects from next live node from the stack

[@akshaya5919]

Nyc explanation. I clearly understood just by listening for first tym itself.Thank u sir.

[@SudhakarAtchala]

Glad to hear that. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@gvindya8488]

Thank you so much for the videos sir. They are a life saver 💯💯 wouldn't have passed my COA exam without these videos

[@SudhakarAtchala]

Welcome vindya. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@azverndias913]

Sheesh keep it up , easily understood this thanks to you. God bless you

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@yarramneninikhil1299]

We have compare lower bound know sir c^n

[@sidduroy9150]

Great Work sir, keep doing all the best

[@SudhakarAtchala]

Thanks a lot. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@challaanitha8834]

Thank you sir .. Great explanation sir it was very understandable keep it up sir.

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@ritikakosigi9176]

thank you sir!!! this was the most confusing topic. the explanation was very clear

[@SudhakarAtchala]

Glad to hear that. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@pavanganeshvodnala2550]

Thank you so much sir,for clear explanation 🎉❤

[@SudhakarAtchala]

Always welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@user-uv1ic3qw4g]

Iam passed many subjects by listening u r classes only sir

[@SudhakarAtchala]

Congratulations. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@user-uv1ic3qw4g]

U r explaination is good sir

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@rajusiddi5726]

Thank you so much sir your vedios are me a lot for preparation 😊

[@SudhakarAtchala]

All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...

[@bhargav5611]

Nice explanation sir thank you

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@makergamesop]

And Thank u so much sir ❤

[@SudhakarAtchala]

You are most welcome.

[@user-ml8fq8yd5o]

Thank u sooo much sir...

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@Pgggg]

dear sir, also write the code if possible. it will help more in the explanation

[@SudhakarAtchala]

In future definitely I will upload a video on algorithm but now because of lack of time I am unable to focus on code.

[@user-um1el4ws7u]

Thank you sir😊

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@trsk]

Thank you sir....

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@guddojiramesh3667]

Please explain backtracking algorithms and Hamiltonian circuits

[@SudhakarAtchala]

Refer to the daa playlist once, kzbin.info/aero/PLXj4XH7LcRfAG09GbFgMOLACfvbMplHsW

[@Phaniiiiiiiii1614]

Sir nice explanation

[@SudhakarAtchala]

Thanks and welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@silentxmoon867]

thank you sir

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@ostrich1233]

Sir plzz explain travelling salesman problem in FIFO branch and bound

[@SudhakarAtchala]

Ya sure. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@ostrich1233]

@@SudhakarAtchala already subscribed sir. Sir can u plzz explain implementing L attributed sdd . U explained entire chapter but didn't explain that topic. N i can't understand any others explanation..

[@naninaresh7219]

Sir, what is the difference between fifo and lcbb 0/1 knapsack problem

[@SudhakarAtchala]

Fifo doesn't guarantee optimal sol where as lcbb guarantees optimal sol. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@rengarajansrinivasan4356]

Thanks a ton sir!!!

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@BhavyasriVangala-yk9ue]

Superb explanation 🤌🥳

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@adityadeshmukh5844]

Thank you sir👍.tomorrow is my exam

[@SudhakarAtchala]

All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@sreeshanthreddykunta]

To further explore the node should we compare the u^n or c^ n sir...

[@Oneman5333]

C^n

[@Raju-qf6sy]

I am going to have supply today sir😢

[@SudhakarAtchala]

All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@aravinreddy]

Sir at 23:11 what if both lower bound and upper bound is same for 6th node and 7th node..?? Then which we have to choose

[@SudhakarAtchala]

Then it is your choice, you can choose one of them. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@aravinreddy]

@@SudhakarAtchala ok sir tqq..

[@makergamesop]

Guys please like the video ur waching the video one day before the exam and forget to thank the sir like the video guys it will help them

[@SudhakarAtchala]

So nice of you ❤️