7 Branch and Bound Introduction
HTML-код
- Опубликовано: 17 сен 2024
- Introduction to Branch and Bound
State Space Trees
FIFO Branch and Bound
LIFO Branch and Bound
LC Branch and Bound
PATREON : www.patreon.co...
Courses on Udemy
================
Java Programming
www.udemy.com/...
Data Structures using C and C++
www.udemy.com/...
C++ Programming
www.udemy.com/...
Real Life Savior...in exams :) .. Thanks a lot!
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
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
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 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
sir you are the greatest mentor i've everseen
If subjects are thaught by well experienced like you it is very interesting to explore Thankyou for your passion towards students
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"
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
tks from Brazil, so clear
Watching this 40 mins before exam💀
10min ☠️
Sir, this is amazing. Incredible explanation!
his way of approach is simply superb...direct approach to concept with out any deviations. but we need Hamiltonian graph problem in backtracking..
❤️🖕
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
i like the way to look back at the cam. its good eye contact.
Real socially working personality love ❤️ you
👏
I love This Subject because of you man.
My teacher teach i could not understand anymore. She make this subject too difficult to understand.
best explanation 🙂
Easy English that everyone can understand thank you for these clear concepts 🤗
Best on the planet 👍🏻👍🏻🙏🏻🙏🏻🙏🏻💯💯💯
sir you teach in a complicated way please make it simple for average students
Guruji you are great. Thanks for easily understanding this topic
Understood it immediately...thx from bottom of my heartiest ❤️
NICE SUPER EXCELLENT MOTIVATED
Watching 4 hour before the exam 💀💀
1 hr exm before 😌
thank u sir this video is very helpful ... it saves me from a big dilemma
Thanks a lot for the explanation.U have made DS&Algo a piece of cake..Once again Thanks a lot
bro i love this guy
Thank you for your hard work
You r doing amazing work sir. God bless u
very good lectures from you. Please keep it up.
Thanks you so much for help me to understand this algoritmo
Watching 14 hours 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.
love from Kl University❤
thank you for your videos sir really helpfull...
Will watch 1 hour before exam.good 🌃
correction: Breadth-First-Search is visiting all nodes at the level by level.
3:45 missed no 14
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 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?
simple and best explanation!!
Are you there here for your ADA's paper😁😄
Watching 10 min before exam in 2x💀💀
Post edit: I passed my exam 💀🥳
Sir you are such a great person ......thank u so much sir
anyone knows the time complexity of branch and bound algorithm?
Thank you so much Sir for these superb videos..
very good. thank you sir
Excellent award winning 🏆💪
I like you teaching! Best explanation.
wherr is bounding function sir
He is amazing
sir, please include lower bound theories video tutorials.Also add videos about Monte Carlo method
Very well explained as usual💯👍
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
Awesome 👍👍 sir.
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
Sir how to take costs in minimum cost branch and bound? can we take on our own or will be given in question?
Excellent video, thank you for sharing
We are achiever's I have exam tomorrow now I'm watching it
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?
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 4:00 there is only 16 nodes, not 17. Since we have 4 jobs
After 13, he wrote 15 directly so getting 17.
Is LC-BB similar to greedy approach?
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.
Good teaching 👌 sir..
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
you are the best teacher.. Thank you its really help..
This lecture is fully dependent on referring javatpoint
Really good.. thanks..
Thanks sir good teaching
DANKE!
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?
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 👍
Good videos , thanks
Thank you,sir
Watching 2 hour before exam
Watching before 30min of exam
Why did we discard J1 while exploring 3rd node in FIFO BB?
what is the difference between divide and conquer and branch and bound ?
Watching 1 hour before exam🤒
VEry good, thank you
You are amazing, thank you for your help !!
why have you discarded first job in second branching,i.e., for J2 there is no J1
Sir can u explain Travelling sales person by branch and bound
FIFO Branch and Bound problem
Master at minute 0.54 you are mentioned about two methods to generate state space tree? can you can tell what are they ?
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
thanks for complete my presentation ..
Watching just 1 hour before exam😅😎
Tq so much sir
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
I think ,I'm training my English listening in this video
Even more if you aren't a native speaker, which is my case
do we use depth first search in least cost branch bound?
Today is my exam🥲
Same😢
Thank you Sir!
THANK YOU SIR
Thanks a lot