The strength of lower bounds for the span in channel assignment problems is discussed with reference to standard benchmark problems. It is shown that in some circumstances current bounds are capable of very significant improvement. The use of methods from mathematical programming is outlined and a new lower bound applicable to cellular problems is presented.
['Derek H. Smith', 'Stephen Hurley', 'Stuart Michael Allen']
A new lower bound for the channel assignment problem