7 Branch and Bound Introduction

preview_player
Показать описание
Introduction to Branch and Bound
State Space Trees
FIFO Branch and Bound
LIFO Branch and Bound
LC Branch and Bound

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

Data Structures using C and C++

C++ Programming
Рекомендации по теме
Комментарии
Автор

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

NoctLightCloud
Автор

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

melissagblinwon
Автор

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

febinmathew
Автор

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

qjack
Автор

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

zaidansari
Автор

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

vivekchanumolu
Автор

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

suciuandreicornel
Автор

sir you are the greatest mentor i've everseen

saigayathriravichandran
Автор

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"

gamersquad
Автор

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

laxmiprashanth
Автор

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

iwishthiswouldwork
Автор

I love This Subject because of you man.

My teacher teach i could not understand anymore. She make this subject too difficult to understand.

yasueayaka
Автор

Finally found My Teacher who can teach me.

amitkumarsingh
Автор

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

vikings_kingdom
Автор

Real socially working personality love ❤️ you

shrutisharma
Автор

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

kartik-ylgu
Автор

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.

chrisjfox
Автор

Sir, this is amazing. Incredible explanation!

abob
Автор

Watching 10 min before exam in 2x💀💀

Post edit: I passed my exam 💀🥳

Sandeep-wvpz
Автор

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

Kwatch