1. K.I. Aardal, A. Hipolito, C.P.M. van Hoesel, B. Janssen, A branch-and-cut algorithm for the frequency assignment problem, Research Memorandum 96/011, Maastricht University, 1996.
2. Some simplified NP-complete graph problems;Garey;Theoret. Comput. Sci.,1976
3. A.W.J. Kolen, A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem, Working paper, 1997.
4. R. Müller, A.S. Schulz. Transitive packing, in: W.H. Cunningham, S.T. McCormick, M. Queyranne (Eds.), Integer Programming and Combinatorial Optimization, pp. 430–444, Vancouver, British Columbia, Canada, 1996. 5th Int. IPCO Conf.
5. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.