Efficient algorithms for the capacitated concentrator location problem (Q1088878)

Topological design of computer communication networks is a very difficult problem. This problem is generally disaggregated into a number of ''simpler'' problems. One of these ''simpler'' problems is the capacitated concentrator location problem. The paper makes use of the Lagrangian relaxation approach to develop optimal and heuristic solution procedures for this problem. Computational experiments show these procedures to be both efficient and effective. The heuristic solution procedure is compared to previously developed algorithms and found to generate significantly better results.