Topological design of computer communication networks

Abstract

The author develops a nonlinear formulation of the topological design problem, and obtains a Lagrangean relaxation of the problem. The Lagrangean solutions provide lower bounds on the optimal solutions, which are further improved using subgradient optimization procedures. Heuristics are developed for generating feasible solutions to the problem. The quality of solutions generated by this heuristic are compared to the lower bounds generated by the Lagrangean procedures on a set of test cases.<>