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

DOI10.1016/J.COR.2005.07.003zbMATH Open1159.90324OpenAlexW2070220282MaRDI QIDQ858274FDOQ858274

Authors: Hong Yuan Zhang, Hanyu Gu, Yugeng Xi 

Publication date: 9 January 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.07.003

Recommendations

• Planning algorithm for WCDMA base station location problem based on cluster decomposition
• A nested Benders decomposition approach for telecommunication network planning
• Optimal base station positioning and channel assignment for 3G mobile networks by integer programming
• Optimization of Base Stations Positioning in Mobile Networks
• A rolling window optimization method for large-scale WCDMA base stations planning problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Decomposition methods (49M27)

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• Title not available (Why is that?)
• A survey on Benders decomposition applied to fixed-charge network design problems
• Benders-and-cut algorithm for fixed-charge capacitated network design problem
• Optimal solution of cellular manufacturing system design: Bender's decomposition approach
• Combinatorial optimization algorithms for radio network planning

Cited In (3)

• Planning algorithm for WCDMA base station location problem based on cluster decomposition
• A nested Benders decomposition approach for telecommunication network planning
• A rolling window optimization method for large-scale WCDMA base stations planning problem

This page was built for publication: A Benders decomposition algorithm for base station planning problem in WCDMA networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858274)