Any radio network (cell) providing service to a geographical region is associated with certain interference environment described by so-called compatibility matrix which, in turn, defines the required frequency limitations between separate cells. An engineering approach to fixed channel allocation (frequency planning) could be described as a trial to find such a frequency plan which would satisfy all the matrix constraints and would have the shortest width (span). The combinatorial nature of this problem makes it unrealistic to obtain the optimal solution. The only way to solve it is to use a certain set of heuristic algorithms based on the features of the compatibility matrix.