TY - GEN
A1 - Borndörfer, Ralf
A1 - Eisenblätter, Andreas
A1 - Grötschel, Martin
A1 - Martin, Alexander
T1 - The Orientation Model for Frequency Assignment Problems
N2 - Mobile telecommunication systems establish a large number of communication links with a limited number of available frequencies; reuse of the same or adjacent frequencies on neighboring links causes interference. The task to find an assignment of frequencies to channels with minimal interference is the frequency assignment problem. The frequency assignment problem is usually treated as a graph coloring problem where the number of colors is minimized, but this approach does not model interference minimization correctly. We give in this paper a new integer programming formulation of the frequency assignment problem, the orientation model, and develop a heuristic two-stage method to solve it. The algorithm iteratively solves an outer and an inner optimization problem. The outer problem decides for each pair of communication links which link gets the higher frequency and leads to an acyclic subdigraph problem with additional longest path restrictions. The inner problem to find an optimal assignment respecting an orientation leads to a min-cost flow problem.
T3 - ZIB-Report - TR-98-01
KW - Minimum-Cost Flow Problems
KW - Cellular Radio Telephone Systems
KW - Frequency Assignment Problem
KW - Integer Programming
Y1 - 1998
UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/562
UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-5627
ER -