Efficient algorithms for the capacitated concentrator location problem
Computers and Operations Research
Hierarchial concentrator location problem
Computer Communications
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
Journal of the ACM (JACM)
Design and Analysis of Computer Communication Networks
Design and Analysis of Computer Communication Networks
A note of the knapsack problem with special ordered sets
Operations Research Letters
| Hi-index | 0.24 |
This paper deals with the problem of locating concentrators in a computer communications network where the terminals could have multiple concentrator coverage. A mathematical programming model is developed. The objective is to maximize the benefits of having multiple concentrator connections for terminals while simultaneously minimizing communication costs as well as set up and operating costs for the concentrators subject to capacity constraints. A Lagrangian relaxation of the problem is presented, and a solution procedure based on subgradient optimization is developed. Computational results indicate that this solution procedure is very effective with mean gaps between the best feasible solution value and upper bound less than 0.5%.