The speaker describes branch and bound in mixed-integer programming as starting from an approximation, branching into alternative solutions in a tree search, and pruning nodes when information shows they are worse than an existing solution.

“And specifically like in mixed energy programming to not go too deep they have a process called branch and bound which essentially you you start off with like a uh a approximation and then based on a solution you you pick two different solutions just like in like a tree search or it is a tree search and you go uh this node you go further down but close it something like alpha go uh like alpha beta pruning you can prune away lots and lots of notes if you know more information by basically say”

“with this node is worse than the solution that I already found, uh so I can remove that. So it becomes really important if you have like let's say a huge tree with let's say thousands of open notes at the bottom to choose which one to actually end up selecting.”