Efficient algorithms for the capacitated concentrator location problem
Computers and Operations Research
An overview of representative problems in location research
Management Science
Optimization of resource location in hierarchical computer networks
Computers and Operations Research
Comparative analysis of topological design algorithms for hierarchical networks.
Automatic Control and Computer Sciences
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Hierarchial concentrator location problem
Computer Communications
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Optimization of a database hierarchy for mobility tracking in a personal communications network
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Distributed Computing: Associated Combinatorial Problems
Distributed Computing: Associated Combinatorial Problems
Capacitated location-allocation problems on a line
Computers and Operations Research
Heuristics for Distribution Network Design in Telecommunication
Journal of Heuristics
Cost-optimal topology planning of hierarchical access networks
Computers and Operations Research
Solving the hub location problem with modular link capacities
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Capacitated facility location problem with general setup cost
Computers and Operations Research
On the capacitated concentrator location problem: a reformulation by discretization
Computers and Operations Research
A review of hierarchical facility location models
Computers and Operations Research
Tabu based heuristics for the generalized hierarchical covering location problem
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
Computers and Industrial Engineering
| Hi-index | 0.01 |
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacities of concentrators and routers the problem is to determine how many concentrators and routers should be used, where they should be located and which users to assign to each concentrator and which concentrators to allocate to each router. A Lagrangean relaxation is used to provide lower bounds for this problem, which are tentatively strengthened by incomplete optimization through the use of CPLEX. A tabu search meta-heuristic is then developed. Computational experiments are performed using a set of randomly generated problems.