Common Contracts
1 similar null contracts
END USER LICENCE AGREEMENTJuly 26th, 2018
z is a positive number and the maximization of it accounts for achieving as much as possible a balance in terms of number of links associated with the deployed BSs. Constraint (3.8a) is also added to achieve the desired bal- ance of D2D links’ association within the multi-cell topology by keeping the sums of the second part of the inequality close to the value of z. This opti- mization problem is an ILP problem that due to the unimodular property of its aggregate inequality matrix (i.e. determinant of every square inequality sub-matrix equals to 1) can be solved efficiently and easily, since it resem- bles the computational complexity of the corresponding linear (fractional) program. Additionally, let us denote by s the final solution vector for this optimization problem. It consists of the decision variable y as well as the z-constrained integer variable and can be mathematically represented as s
