Abstract
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 assign test points to them. Subsequently, the relationship between the integer sub-problems and their linear relaxations is investigated, which leads to the equivalence of the integral optimal solutions to the original integer programming model and its relaxation. Finally the classic Benders decomposition algorithm is applied to solve WCDMA base station planning problem. Simulation results show that the computational efficiency of the proposed algorithm can meet the requirements in practical applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
