OPTIMAL CHANNEL ASSIGNMENT IN CELLULAR NETWORKS.

In this paper, we consider the problem of assigning frequencies to mobile terminals in a cellular network. We show that an optimal solution can be obtained by solving a sequence of alternating linear and quadratic maximization programming problems. We address co-channel constraints and adopt as an objective function the maximization of potentially established calls. Our algorithm is fairly general, and does not depend on any special network structure. This study indicates that mathematical programming can be used as an efficient technique for solving the aforementioned problem. [ABSTRACT FROM AUTHOR]