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
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
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.
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!
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
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"
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.
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.
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.
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?
@@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.
How to calculate costs for nodes. In least cost as u did... 25 .12 ..19 ..30 in ist level and 8 and 7 in. 2nd level .. Would it be given in a question. Or we have to calculate it all by ourselves ?? And what is this p={10,5,8,3} d={1,2,1,2}. U Haven't mentioned it !!
Dear Professor, I want to ask.. Why the solution is {J1,J4} not {J1,J2}. {J1,J4} total profit is 13 and {J1,J2} total profit is 15 why not take {J1,J2}?
@@abdul_bari J1 and J4 deadline both is 2, isn't it? so when in deadline1 time we choose J1 and then into deadline2 time we choose J2 because its profit is bigger than J4, isn't it?
Maybe I confused what you defined the deadline meaning. My understanding is when tree level=1, that means is deadline1, so we can choose anyone, and when tree level=2, it means is deadline 2, so in this level, we cannot choose less than deadline2 of job (like deadline1 of job). Is this right?
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
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.
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
Real Life Savior...in exams :) .. Thanks a lot!
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
Sir, these are the best lectures I heard for DAA ,so far. Your explanation is clean and also clear , THANK YOU for these videos
Watching this 40 mins before exam💀
10min ☠️
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
yrr tumhe kya samajh aata hai is hippo ka
omg I wished to give you the salary of my useless, passionless math professor. She hates students! Greetings from Austria, and THANK YOU.
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.
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!
@Stanley Arthur instablaster ;)
@@stanleyarthur3062 did u find
Watching 10 min before exam in 2x💀💀
Post edit: I passed my exam 💀🥳
If subjects are thaught by well experienced like you it is very interesting to explore Thankyou for your passion towards students
Watching 2 days before exam ☠️😢😢
Me watching one day before exam
@@vishwajeetarkile2036 tq
I am in exam
Watching 7 hrs before exam
Dus minute m exam hai mera
thank you kind sir, I will not fail my exams this time! Good luck y'all
Finally found My Teacher who can teach me.
Wow
sir you are the greatest mentor i've everseen
his way of approach is simply superb...direct approach to concept with out any deviations. but we need Hamiltonian graph problem in backtracking..
❤️🖕
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
More of a mix and match of bfs and dfs
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"
i like the way to look back at the cam. its good eye contact.
Sir, this is amazing. Incredible explanation!
I love This Subject because of you man.
My teacher teach i could not understand anymore. She make this subject too difficult to understand.
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.
Real socially working personality love ❤️ you
👏
Easy English that everyone can understand thank you for these clear concepts 🤗
tks from Brazil, so clear
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.
Thanks a lot for the explanation.U have made DS&Algo a piece of cake..Once again Thanks a lot
Will watch 1 hour before exam.good 🌃
Best on the planet 👍🏻👍🏻🙏🏻🙏🏻🙏🏻💯💯💯
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.
thank u sir this video is very helpful ... it saves me from a big dilemma
Watching 14 hours before exam😵💫😵💫
best explanation 🙂
Guruji you are great. Thanks for easily understanding this topic
Understood it immediately...thx from bottom of my heartiest ❤️
Indian legendry teacher !!!
love from Kl University❤
thank you for your videos sir really helpfull...
You r doing amazing work sir. God bless u
very good lectures from you. Please keep it up.
3:45 missed no 14
correction: Breadth-First-Search is visiting all nodes at the level by level.
Watching before 20 min of exam😹💀
With 2x speed☠️
Thanks you so much for help me to understand this algoritmo
NICE SUPER EXCELLENT MOTIVATED
bro i love this guy
Watching 4 hour before the exam 💀💀
1 hr exm before 😌
Sir you are such a great person ......thank u so much sir
Excellent award winning 🏆💪
I like you teaching! Best explanation.
sir, please include lower bound theories video tutorials.Also add videos about Monte Carlo method
simple and best explanation!!
Are you there here for your ADA's paper😁😄
Watching 1 hour before exam🤒
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?
Listen around 0:30, you can convert a maximisation-problem into a minimisation-problem and then solve it.
@@1matzeplayer1 what does it mean maximization and minimization?
@@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.
Thank you for your hard work
Thank you so much Sir for these superb videos..
Very well explained as usual💯👍
sir branch and bound use bfs and bfs use queue data structure at time 5.00 you used stack pls explain?
i had the same doubt , because the searching method is now acting as DFS, Did you get answer for that?
At 4:00 there is only 16 nodes, not 17. Since we have 4 jobs
After 13, he wrote 15 directly so getting 17.
@@Rohit-tz6gs14 missed I mean he forgot to write 🙃
We are achiever's I have exam tomorrow now I'm watching it
Sir how to take costs in minimum cost branch and bound? can we take on our own or will be given in question?
Sir when we taking stack in branc and bound it undergoes to depth for search ,but in BB we follow bfs ???
You are right. When we are using stack(LIFO) for exploration of nodes happening DFS not BFS.
You are correct
@@tulasidamarla Yes it is now doing DFS , so is it now backtracking?
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
you are the best teacher.. Thank you its really help..
Kindly explain
Definition of the state space.
?
Branching operation.
?
Feasibility checking operation.
?
Bounding operation.
?
check the previous videos you may get some of the answers
watching this inside of the exam hall, wish me luck
Awesome 👍👍 sir.
At 3:48 instead of writing 14 you have written 15 by mistake I guess if I'm not wrong sir.
Please do reply asap
Abdul Bari Thank you sir 🙂
Excellent video, thank you for sharing
I think ,I'm training my English listening in this video
Even more if you aren't a native speaker, which is my case
Watching on exam day😅
You made my day
very good. thank you sir
He is amazing
anyone knows the time complexity of branch and bound algorithm?
Good teaching 👌 sir..
Watching just 1 hour before exam😅😎
sir you teach in a complicated way please make it simple for average students
Watching before 30min of exam
Is LC-BB similar to greedy approach?
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?
it is least cost node
How to calculate costs for nodes. In least cost as u did... 25 .12 ..19 ..30 in ist level and 8 and 7 in. 2nd level ..
Would it be given in a question. Or we have to calculate it all by ourselves ??
And what is this
p={10,5,8,3} d={1,2,1,2}. U Haven't mentioned it !!
In 1st branching You didn't put 14th node. You got totally 16 nodes. Hope it was some numbering mistake?
Watching 1.5 hr before exam
Today is my exam🥲
Same😢
Dear Professor, I want to ask..
Why the solution is {J1,J4} not {J1,J2}.
{J1,J4} total profit is 13 and {J1,J2} total profit is 15
why not take {J1,J2}?
@@abdul_bari J1 and J4 deadline both is 2, isn't it?
so when in deadline1 time we choose J1 and then into deadline2 time we choose J2 because its profit is bigger than J4, isn't it?
Maybe I confused what you defined the deadline meaning.
My understanding is when tree level=1, that means is deadline1, so we can choose anyone,
and when tree level=2, it means is deadline 2,
so in this level, we cannot choose less than deadline2 of job (like deadline1 of job).
Is this right?
at 3:48 shouldn't it be 14 rather than 15?
thanks for complete my presentation ..
Sir can u explain Travelling sales person by branch and bound
FIFO Branch and Bound problem
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
Thanks sir, very helpful and i scored good marks.
Thanks sir good teaching
why have you discarded first job in second branching,i.e., for J2 there is no J1
Watching on the exam day 😂
Watching 5 hours before the exam
Watching 30 min before exam
This lecture is fully dependent on referring javatpoint
Really good.. thanks..
watching during exam
You are amazing, thank you for your help !!
Is d tree in LIFO and LC complete?? In LIFO , do v not have to expand j2,j3 and j4?????
I think we should expand them in LIFO and I got 16 nodes in total. Correct me if I'm wrong!
I think the tree in LC is complete but the tree in LIFO is incomplete because he wasn't expanded the node10 and node11.
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.
After popping the number 2 stack becomes empty so we will be stopping there
@@-R-Deeksha Got it now 👍
wherr is bounding function sir
Sir,in LIFO why you stopped in 11,12,13 why didn't the tree further grow