Finding optimum base station locations for a cellular radio network is cons
idered as a mathematical optimization problem. Dependent on the channel ass
ignment policy, the minimization of interferences or the number of blocked
channels, respectively, may be more favourable. In this paper, a variety of
according analytical optimization problems are introduced. Each is formali
zed as an integer linear program, and in most cases optimum solutions can b
e given. Whenever by the complexity of the problem an exact solution is out
of reach, simulated annealing is used as an approximate optimization techn
ique. The performance of the different approaches is compared by extensive
numerical tests.