Discrete Optimization with Branch and Bound

Integer, Mixed Integer Linear, and Mixed Integer Nonlinear Programming (IP, MILP, MINLP) problems can be solved with the branch and bound algorithm. The example problem covers a two variable nonlinear problem that demonstrates the algorithm and compares it to an exhaustive search.