Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Decomposition technique for fixed channel assignment problems in mobile radio networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Giortzis, A.I. ; Imperial Coll. of Sci., Technol. & Med., London, UK ; Turner, L.F. ; Barria, J.A.

The paper is concerned with the possibility of using a decomposition technique to solve fixed channel assignment (FCA) problems. The main idea is first to transform and then to decompose the original large FCA problem into a number of smaller-size connected integer linear programming (ILP) sub-problems. A sequential branch-and-bound algorithm is then used to solve optimally and efficiently the sub-problems. The computational results obtained when the technique is applied to a number of different benchmark problems confirm that the proposed technique is computationally efficient in solving large-scale FCA problems and that it is capable of significantly reducing the computation time involved. The technique also makes it possible in some cases to solve large-scale FCA problems

Published in:

Communications, IEE Proceedings-  (Volume:147 ,  Issue: 3 )