Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem

Montemanni, R., Smith, D.H. and Allen, S. M. 2004. An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem. European Journal of Operational Research 156 (3) , pp. 736-751. 10.1016/S0377-2217(03)00127-9

Full text not available from this repository.


Frequencies have to be assigned to transmitters whenever a radio network is established or modified. This is ideally done is a way which minimises interference in the network. Lower bounds are necessary to establish the effectiveness of the heuristic algorithms used for this task and to assess the quality of the assignments obtained. In the fixed spectrum frequency assignment problem the available frequencies are known in advance. The constraints are often binary constraints, specifying the necessary frequency separation between given pairs of transmitters. There may be penalties (or weights) associated with the violation of each constraint; it is then either necessary to minimise the number of constraints violated or, increasingly often, to minimise the sum of the weights associated with violated constraints. A technique for generating lower bounds for these quantities is presented. This is an evolution of a technique which has recently appeared in the literature. It produces better quality bounds, is in general significantly faster and allows larger problems to be handled.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Lifelong Learning
Publisher: Elsevier
ISSN: 0377-2217
Date of Acceptance: 30 October 2002
Last Modified: 13 Mar 2020 16:12

Citation Data

Cited 11 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item