A Benders decomposition algorithm for base station planning problem in WCDMA networks

This paper analyzes the integer programming model and its relaxations of WCDMA base station planning problem for Up-Link with integer and nonlinear constraints. Firstly, the base station planning problem is decomposed into several “sub-problems” for every set of activated base stations to optimally...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research 2007-06, Vol.34 (6), p.1674-1687
Hauptverfasser:	Zhang, Hong-Yuan, Gu, Han-Yu, Xi, Yu-Geng
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Decomposition Exact sciences and technology Facilities planning Integer programming Operational research. Management science Studies Wireless networks
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!