7 Branch and Bound Introduction

Introduction to Branch and Bound
State Space Trees
FIFO Branch and Bound
LIFO Branch and Bound
LC Branch and Bound
PATREON : www.patreon.com/bePatron?u=20...
Courses on Udemy
================
Java Programming
www.udemy.com/course/java-se-...
Data Structures using C and C++
www.udemy.com/course/datastru...
C++ Programming
www.udemy.com/course/cpp-deep...

[@febinmathew7]

Real Life Savior...in exams :) .. Thanks a lot!

[@melissagblinwon9838]

This guy is really saving my life, I almost thought of giving up my course cuz my lectures made this topic seem difficult to understand. I wish I could give you their salary every month

[@NoctLightCloud]

omg I wished to give you the salary of my useless, passionless math professor. She hates students! Greetings from Austria, and THANK YOU.

[@apusingh1967]

yeah some teachers feel students are dumb and hate it. but they have the problem. they are not able to teach since they do not understand concepts and probably did their degrees by brute force memorizing the subject.

[@stanleyarthur3062]

you probably dont give a damn but does anybody know a tool to get back into an Instagram account..? I stupidly forgot the password. I would love any tricks you can give me!

[@enriquedamian2023]

@Stanley Arthur instablaster ;)

[@_ajay1_37]

​@@stanleyarthur3062 did u find

[@vivekchanumolu3046]

Sir, these are the best lectures I heard for DAA ,so far. Your explanation is clean and also clear , THANK YOU for these videos

[@qjack]

I am a senior developer and this video is such a lifesaver, I probably come back to it once a month. JK im a student who doesnt go to class

[@HeiderJeffer]

Dear Respected Professor Abdul Bari, Can we use a simplex algorithm in Lean Startup methodology to find the optimal/ feasible solution for MVP (Minimum viable product ) ? Looking forward for advice Very truly yours Heider

[@abob2457]

Sir, this is amazing. Incredible explanation!

[@89zaidansari86]

Sir u r trully a gem 💎 Ur teaching level is so adorable U r using a easiest flow of English from which everyone can understand what u r saying And the last thing that u just nailed it

[@gagansain1664]

yrr tumhe kya samajh aata hai is hippo ka

[@ernanibatista1806]

tks from Brazil, so clear

[@vaibhavgajbey5311]

thank u sir this video is very helpful ... it saves me from a big dilemma

[@saigayathriravichandran]

sir you are the greatest mentor i've everseen

[@kshitijsingh609]

You r doing amazing work sir. God bless u

[@saisilpabijjala7046]

Understood it immediately...thx from bottom of my heartiest ❤️

[@nihabhagavatula8890]

Thanks a lot for the explanation.U have made DS&Algo a piece of cake..Once again Thanks a lot

[@saadmahboob3084]

very good lectures from you. Please keep it up.

[@kshitijakulkarni8292]

Thank you so much Sir for these superb videos..

[@alfredkik3675]

I like you teaching! Best explanation.

[@gamersquad8819]

sir please upload these topics also "Least Cost(LC) Search, The15-puzzle problem, Control abstractions for LCSearch, FIFO Branch-and-Bound, LC Branch-and-Bound"

[@pruthvitanneru4559]

Guruji you are great. Thanks for easily understanding this topic

[@suciuandreicornel2746]

thank you kind sir, I will not fail my exams this time! Good luck y'all

[@Kwatch]

i like the way to look back at the cam. its good eye contact.

[@laxmiprashanth9482]

If subjects are thaught by well experienced like you it is very interesting to explore Thankyou for your passion towards students

[@iwishthiswouldwork1]

Hi, excellent material and great explanations. I believe LIFO Branch and Bound that you're describing is a depth-first search, based on the definition of DFS/BFS and from wikipedia for B&B

[@arunsharma2999]

More of a mix and match of bfs and dfs

[@rohithauppala]

Sir how to take costs in minimum cost branch and bound? can we take on our own or will be given in question?

[@sahilchandel7152]

Watching 4 hour before the exam 💀💀

[@vikings_kingdom763]

his way of approach is simply superb...direct approach to concept with out any deviations. but we need Hamiltonian graph problem in backtracking..

[@NithishKumar-iz2fu]

❤️🖕

[@vishwajeetarkile2036]

Watching 2 days before exam ☠️😢😢

[@3thrisha869]

Me watching one day before exam

[@3thrisha869]

@@vishwajeetarkile2036 tq

[@lovesaxena0024]

I am in exam

[@filamentofbulb]

Watching 7 hrs before exam

[@himanshumishra8409]

Dus minute m exam hai mera

[@mansmor7211]

Very well explained as usual💯👍

[@luisfernandopazgaleano1472]

Thanks you so much for help me to understand this algoritmo

[@shubhamojha8886]

Sir you are such a great person ......thank u so much sir

[@dkeyes501]

Excellent video, thank you for sharing

[@shihlihsu9918]

Thank you Sir!

[@yasueayaka638]

I love This Subject because of you man. My teacher teach i could not understand anymore. She make this subject too difficult to understand.

[@mohammedadel8948]

Thank you for your hard work

[@khansaab-ho4cb]

love from Kl University❤ thank you for your videos sir really helpfull...

[@deepakranganathan9644]

simple and best explanation!!

[@Farahat1234]

Are you there here for your ADA's paper😁😄

[@ramizayaasmeen5356]

Easy English that everyone can understand thank you for these clear concepts 🤗

[@rojithreji8413]

sir, please include lower bound theories video tutorials.Also add videos about Monte Carlo method

[@trezabhat33]

Sir can u make a video on how to divide a set into three subset such that sum of the elements in each subset has minimum difference using branch and bound

[@theaditya752]

Why did you take different cost for J3 and j4 at 8:52 ? Is it because of the fact we are going from node 3 instead of 1?

[@SigmaGrindsetMindset]

Watching this 40 mins before exam💀

[@GAUTAM-zy6et]

10min ☠️

[@venkatramana9359]

Thank you,sir

[@evinaslan164]

Really good.. thanks..

[@DILIPKUMAR-ws7td]

Thanks sir good teaching

[@amitkumarsingh2707]

Finally found My Teacher who can teach me.

[@Thammudu_____]

Wow

[@SudarshanKrSingh]

Good videos , thanks

[@fiveh8muthavarapu403]

Good teaching 👌 sir..

[@solutions9991]

VEry good, thank you

[@ganeshjaggineni4097]

NICE SUPER EXCELLENT MOTIVATED

[@sadrahakim1272]

very good. thank you sir

[@pocof3gt309]

Excellent award winning 🏆💪

[@roopanrodin7924]

sir,for bfs approach we must use queue,but your explanation is in stack for bfs ,which one is correct sir.Is it correct that branch and bound follows bfs

[@shashibhushan7294]

sir branch and bound use bfs and bfs use queue data structure at time 5.00 you used stack pls explain?

[@shivanshusuryakar8692]

i had the same doubt , because the searching method is now acting as DFS, Did you get answer for that?

[@tekszhufuni2963]

you are the best teacher.. Thank you its really help..

[@shrutisharma3962]

Real socially working personality love ❤️ you

[@unnikrishnan3910]

👏

[@xlayman38]

correction: Breadth-First-Search is visiting all nodes at the level by level.

[@saikumarmadala5547]

Sir when we taking stack in branc and bound it undergoes to depth for search ,but in BB we follow bfs ???

[@tulasidamarla]

You are right. When we are using stack(LIFO) for exploration of nodes happening DFS not BFS.

[@sambasivaraovuyyuru7724]

You are correct

[@shivanshusuryakar8692]

@@tulasidamarla Yes it is now doing DFS , so is it now backtracking?

[@seshasaisreechandra3780]

But when you are going to a node , you typically expand that nodes all children but not go onto the nodes child and there child straight away

[@kartik-yl2gu]

sir you teach in a complicated way please make it simple for average students

[@chrisjfox8715]

When creating the first tree to begin with, [specifically at the 3:26 mark] why is the choice being made to only allow job numbers to be made in order of index number? That was not explained. That seems to be either an arbitrary choice or a very circumstantial one, depending on the application. Given the very generic setup beforehand, nothing says that J_j can't come before J_i for some j>i unless that constraint is given; the way this tree was created, it's as if all of these jobs have precedence with each other despite the fact that all of them are not necessarily needed. Please assist.

[@AlayDhagia]

You are amazing, thank you for your help !!

[@ankush_in_sync5998]

THANK YOU SIR

[@nishantpall1747]

Is LC-BB similar to greedy approach?

[@119_shrenikshah7]

anyone knows the time complexity of branch and bound algorithm?

[@mrinalgautam9090]

thanks for complete my presentation ..

[@AnitShrestha]

Thank you.

[@tanmoydutta5846]

Sir, at the beginning, you said that the Branch and Bound technique is used to solve only minimisation problems. But what if at each node in LC-BB technique, we are expanding that node which has maximum cost? Then, won't that be solving a maximisation problem directly?

[@1matzeplayer1]

Listen around 0:30, you can convert a maximisation-problem into a minimisation-problem and then solve it.

[@samirkumarpadhi]

@@1matzeplayer1 what does it mean maximization and minimization?

[@1matzeplayer1]

@@samirkumarpadhi You might remember from school, the function f(x) = -x^2+3 has a maximum at x = 0 f(x) = x^2 - 2 has a minimum at x=0 Just draw the graphs to see it visually. The same thing can be done for most functions by working with derivatives. It should be rather easy to look the topic up.

[@te_b_52_siddeshpatankar14]

Best on the planet 👍🏻👍🏻🙏🏻🙏🏻🙏🏻💯💯💯

[@maxbadarne9149]

bro i love this guy

[@abdeali004]

Awesome 👍👍 sir.

[@Ajinkya_Chirde_07]

best explanation 🙂

[@jahnavimulakalapati5076]

Thanks sir, very helpful and i scored good marks.

[@chaituk2015]

Sir can u explain Travelling sales person by branch and bound FIFO Branch and Bound problem

[@peddaiahsonte358]

thank you sir

[@md.hamjajulashmafeerahat6971]

From Wikipedia: A stack (LIFO queue) will yield a depth-first algorithm. A best-first branch and bound algorithm can be obtained by using a priority queue that sorts nodes on their lower bound.

[@lokendratiwari9820]

Will watch 1 hour before exam.good 🌃

[@shubhampawar3739]

Thank You ☺️

[@daizwap9454]

does it look useless when applied in the cyclic problem?

[@SandeepRana-xn8mk]

what is the difference between divide and conquer and branch and bound ?

[@tubex1300]

Master at minute 0.54 you are mentioned about two methods to generate state space tree? can you can tell what are they ?

[@cbt121314]

Is the least cost BB the same as best-first search BB???

[@yupp_harish3936]

wherr is bounding function sir

[@TheOtherHalfVlogs]

Is d tree in LIFO and LC complete?? In LIFO , do v not have to expand j2,j3 and j4?????

[@saisrikar7987]

I think we should expand them in LIFO and I got 16 nodes in total. Correct me if I'm wrong!

[@dattasaiakash2740]

I think the tree in LC is complete but the tree in LIFO is incomplete because he wasn't expanded the node10 and node11.

[@rithanyabalamurali6936]

do we use depth first search in least cost branch bound?

[@aastikabanstola35]

Watching 14 hours before exam😵‍💫😵‍💫

[@sou768]

Tqsm🥺

[@3thrisha869]

Tq so much sir

[@aruneshnaha4113]

00:00 Branch-and-bound is a problem-solving strategy for optimization problems. 01:16 Two methods for solving variable size job problem: Subset and State Space Tree 02:35 Breadth-first search algorithm for job selection 03:46 Two methods for generating a state space tree 05:00 Exploring nodes using stack 06:18 Using stack or queue for node exploration in branch-and-bound search 07:23 State space tree with cost function 08:40 LC branch and bound is a faster method for exploring nodes with minimum cost. Crafted by Merlin AI.

[@verystablegenius4720]

He is amazing

[@hetvibhatt4311]

Thanks a lot

[@moneybagdeals]

We are achiever's I have exam tomorrow now I'm watching it

[@Ami7166]

In 1st branching You didn't put 14th node. You got totally 16 nodes. Hope it was some numbering mistake?

[@akashpatil1713]

DANKE!

[@Prince-zf7sz]

why have you discarded first job in second branching,i.e., for J2 there is no J1

[@sairamustafa7343]

Kindly explain Definition of the state space. ? Branching operation. ? Feasibility checking operation. ? Bounding operation. ?

[@abhinavdixit3037]

check the previous videos you may get some of the answers

[@swadhindas2208]

Sir, in LC branch and bound don't we somehow using greedy method?

[@dheerajpiano]

At 4:00 there is only 16 nodes, not 17. Since we have 4 jobs

[@Rohit-tz6gs]

After 13, he wrote 15 directly so getting 17.

[@deveshprakash9959]

when solving by using stack ,Sir ,why u stopped after 12 ,can be expanded more after poping node 12,11 and so on. It need to be expanded more. Please reply someone if known.

[@-R-Deeksha]

After popping the number 2 stack becomes empty so we will be stopping there

[@deveshprakash9959]

@@-R-Deeksha Got it now 👍

[@datta3268]

I am confused ... some say that FIFO is Breadth First Search and LIFO is Depth First Search but you mentioned both of them as BFS

[@abderrafiabdeddine7744]

At the end you cover all possible nodes, Right? So how can be the LC-BB faster? Maybe I didn't understand the problem clearly, when founding a node with minimum cost, can we found an other node (in an other branch which has a parent with a higher cost than the other branches) with a lower cost? If so then all the methods are equal

[@gautamsingh434]

sir please tell us in LL-BB method u said solution is J2and J4 but in stating solution is j1and J4 and using LC-BB we get different ans y sir ????