Article ID: | iaor20023272 |
Country: | Netherlands |
Volume: | 107 |
Issue: | 1 |
Start Page Number: | 285 |
End Page Number: | 301 |
Publication Date: | Oct 2001 |
Journal: | Annals of Operations Research |
Authors: | Smith D.H., Hurley Steve, Allen S.M. |
Keywords: | markov processes |
Most writers on frequency assignment algorithms have described the details of a single algorithm, and evaluated the algorithm on selected data sets. There has been relatively little emphasis on describing the common features that are important if an algorithm is to have good performance. This paper describes the key features, with particular emphasis on algorithms for weighted fixed spectrum problems. The use of algorithms handling weighted constraints has become increasingly common in recent years. The advantages and disadvantages of weighting constraints are demonstrated.