GRAPH OPTIMIZATION PROBLEMS IN CONNECTION WITH THE MANAGEMENT OF MOBILE COMMUNICATIONS-SYSTEMS

In this paper, some basic traffic management problems in future mobile communications networks are considered: the channel minimization prob lem and the maximum channel reuse problem. These are formulated as mat hematical optimization problems in a bipartite graph. We prove the int ractability of these problems and discuss relations to well-known grap h optimization problems as, for example, vertex coloring. Simple and f ast heuristic methods for finding reasonable solutions to the problems mentioned above are presented. Results from computational work using these heuristics on simulated traffic are also given.