Branch and Bound Method

Home > Organizational studies > Management Science > Linear Programming > Branch and Bound Method

It is an algorithm used to solve integer programming problems. It involves dividing the feasible region into smaller sub-regions and solving each sub-region using the Simplex method.