Column Generation for Frequency Assignment in Slow Frequency Hopping Networks
This paper deals with the Frequency Assignment Problem (FAP) in slow frequency hopping (GSM) networks, a generalization of the classical FAP. Due to symmetry in the solutions, a natural integer linear programming formulation does not yield a good solution procedure. Instead, the authors decompose the co-channel and adjacent channel interference minimization and develop a two-stage algorithm. The co-channel optimization problem is solved with a column generation model, whereas the second stage is solved by a cutting plane approach. Computational experiments reveal, that although no optimal solutions can be guaranteed, the approach provides promising results, both regarding practical applicability and further research potential.