Optimization of resource location in hierarchical computer networks

In the future, complex computer networks will be controlled and managed using hierarchical structures. The authors provide an integer programming formulation of the problem, and present two approximate algorithms to solve it. One involves a simulated annealing-linear programming hybrid algorithm, and the other is a greedy second best heuristic. Computational results show that these approximate algorithms perform better than a Lagrangian relaxation of the problem.