Operations Research, Mathematical Programming, Optimization, Algorithms, Discrete Optimization.
as “Branch and X” are used to solve Integer, Mixed-Integer and Constraint Programming problems. The most basic example is the Branch & Bound algorithm that solves integer programs. Other include Branch & Cut, Branch & Prune, and Branch & Price (aka Column Generation). Dynamic Programming algorithms