Abstract
We present a maximal covering model for the network design of code division multiplexing access (CDMA) telecommunication system. Properties of the solution and the algorithm have been studied. The model has been developed to solve actual problems; they are extremely large so exact decomposition methods cannot be used to solve it. A Lagrangian decomposition heuristic has been defined. Different algorithm options have been computationally compared using random generated and actual data. Model and algorithm parameters have been adjusted and sensibility of the solution to the data has been considered in these tests.
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.
