Abstract
Gomory and Hu (Ref. 1) formulated the optimal allocation of capacities to the links of a communication networks as a problem in linear programming. The application of this formulation to the solution of problems of realistic size does, however, require an excessive amount of computation. In the present paper, a slightly different formulation is given. The resulting optimality conditions readily lend themselves to the construction of problems with known optimal solutions, thereby providing suitable examples for the assessment of the efficiencies of approximate methods. An approximate method that has been found highly efficient in many cases is illustrated by an example.
Similar content being viewed by others
References
Gomory, R. E., andHu, T. C.,Synthesis of a Communication Network, SIAM Journal on Applied Mathematics, Vol. 12, No. 2, 1964.
Ht, T. C.,Integer Programming and Network Flows, Chapter 11, Addison-Wesley Publishing Company, Reading, Massachusetts, 1969.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Oettli, W., Prager, W. Optimal and suboptimal capacity allocation in communication networks. J Optim Theory Appl 8, 396–411 (1971). https://doi.org/10.1007/BF00929288
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00929288