Article ID: | iaor20091142 |
Country: | United Kingdom |
Volume: | 35 |
Issue: | 4 |
Start Page Number: | 1204 |
End Page Number: | 1226 |
Publication Date: | Apr 2008 |
Journal: | Computers and Operations Research |
Authors: | Jaumard Brigitte, Marcotte Odile, Hemazro Tkogan D. |
Keywords: | communication, programming: integer |
We present an exact algorithm for solving the channel assignment problem in cellular telephony networks. This problem consists of assigning sets of channels to the network cells in such a way that the channel demand is satisfied, while avoiding co-channel interference and adjacent channel interference and respecting the channel spacing constraint for each antenna. In a previous article we formulated this problem as a covering problem in two different ways and compared these two formulations and another formulation both from a theoretical and computational point of view (by solving their linear relaxations). In the present article we focus on the best set covering formulation, where the subsets are sets of cells that can be assigned the same channel, and we actually solve two versions of the integer program.