Operations Research 09B: Branch and Bound for Integer Programming
Textbooks:
https://amzn.to/2VgimyJ
https://amzn.to/2CHalvx
https://amzn.to/2Svk11k
In this video, I'll talk about how to solve IP problems using the branch and bound method. The branch-and-bound algorithm is actually an enumeration of candidate solutions in the search space. It splits the original problem into branches of subproblems.
Before enumerating the candidate solutions of a branch, the branch is checked against upper or lower estimated bounds of the optimal solution. The branch is discarded if it cannot produce a better solution than the best one found so far by the algorithm.
----------------------------------------
Smart Energy Operations Research Lab (SEORL): http://binghamton.edu/seorl
YOUTUBE CHANNEL: / yongtwang
