Algorithm 2 The Dinkelbach’s algorithm.

Initialization phase:

Set iteration $c=1$, ${{\eta }_n}^{\left(c\right)}>0$, the maximum number of iterations $C_{max}$, and error tolerance $\tau >0$.

1: repeat

2: Solve the equivalent problem (23) for a given ${{\eta }_n}^{\left(c\right)}$ to obtain the solution ${{\mathbf{p}}_{fn}}^{\left(c\right)}$.

3: ${{\eta }_n}^{\left(c\right)}=\frac{F^{+}\left({{\mathbf{p}}_{fn}}^{\left(c\right)}\right)-\tilde{F}\left({{\mathbf{p}}_{fn}}^{\left(c\right)}\right)}{{\displaystyle \sum _{f\in \mathcal{F}}}{\displaystyle \sum _{k\in {\mathcal{S}}_{fn}}}{p}_{kfn}{}^{\left(c\right)}+P_c}$,

4: $c=c+1$.

5: until $\left|T({{\eta }_n}^{(c-1)},{{\mathbf{p}}_{fn}}^{(c-1)})\right|\le \tau$ or $c>C_{max}$

6: ${\eta }_n^{*}={{\eta }_n}^{(c-1)}$, ${\mathbf{p}}_{fn}^{*}={{\mathbf{p}}_{fn}}^{(c-1)}$.