Conclusion

Although a number of algorithms have been proposed for the integer linear programming problem, the branch-and-bound technique has proven to be reasonably efficient on practical problems, and it has the added advantage that it solves continuous linear programs as sub problems.

This technique is also used in a lot of software in global optimization.