Improving heuristics for the frequency assignment problem

@article{Smith1998ImprovingHF,
  title={Improving heuristics for the frequency assignment problem},
  author={Derek H. Smith and Steve Hurley and S. U. Thiel},
  journal={European Journal of Operational Research},
  year={1998},
  volume={107},
  pages={76-86}
}
Lower bounds for the frequency assignment problem can be found from maximal cliques and subgraphs related to cliques. In this paper we show that for many types of problem optimal assignments can be found by a process of assigning these subgraphs first, fixing the assignment and then extending the assignment to the full problem. We demonstrate the advantages of the method for some typical examples. In particular we give the first optimal assignments of several variants of the “Philadelphia… CONTINUE READING