Decomposition of the allocation problem

The chief advantage of the proposed algorithm for decomposition of allocation problems, APs is that, in addition to the usual branching in branch-and-bound operations, it helps prove polynomial solvability of new ranges of APs and expanding the known polynomially solvable particular cases of APs.