In this section, we devise algorithms that solve optimally the DPPs described in (REF ) and (REF ). According to [1]}, the most established class of approaches for solving a DPP with reasonable computational complexity is the B&B.
First created in 1960 by A. H. Land and A. G. Doig [2]} the essence of B&B methods consists in eliminating, as many as possible, candidate solutions, such that, the optimal can be computed using exhaustive search. The basics of precoding using B&B method can be found well detailed in the works from [3]}, [4]}, [5]}, [6]}, as such, this study will focus on the specifics of the proposed B&B algorithms.
