The Min-Interference Frequency Assignment Problem

In this book we consider the Frequency Assignment Problem, where the objective is to minimize the cost due to interference arising in a solution. We use a quadratic 0-1 integer programming formulation of the problem as a basis to derive new lower bounds and problem reduction rules. A tree search algorithm that uses the lower bounds and dominance criteria is also presented. Computational results are shown on standard benchmark instances from the literature.