A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network

DOI10.1287/opre.35.3.354zbMath0627.90033OpenAlexW2092305837MaRDI QIDQ3763870

Eric Rosenberg

Publication date: 1987

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.35.3.354

zbMATH Keywords

telecommunications networkinteger nonlinear programmingexact penalty functionrecursive quadratic programmingoptimal number of communications channels

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Nonlinear programming (90C30) Deterministic network models in operations research (90B10)

Related Items

Routing and capacity assignment in backbone communication networks, An algorithm for network dimensioning under reliability considerations, Design of private backbone networks. I: Time varying traffic, Routing and capacity assignment in backbone communication networks under time varying traffic conditions