Maximal covering code multiplexing access telecommunication networks

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.