A linear programming model for design of communications networks with time varying probabilistic demands

DOI10.1002/nav.3800280102zbMath0454.90030OpenAlexW2078816029WikidataQ107106092 ScholiaQ107106092MaRDI QIDQ3902801

No author found.

Publication date: 1981

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800280102

zbMATH Keywords

network hierarchydesign of communications networkslinear programming supply modeltime varying probabilistic demands

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items

Network design and dynamic routing under queueing demand, On the continued Erlang loss function, Equitable transit charges for multi-administration telecommunications networks, A polynomial-time algorithm for message routing in hierarchical communication networks, DOMAIN EXTENSIONS OF THE ERLANG LOSS FUNCTION: THEIR SCALABILITY AND ITS APPLICATIONS TO COOPERATIVE GAMES, Design of private backbone networks. I: Time varying traffic, Transmission facility planning in telecommunications networks: A heuristic approach, Routing and capacity assignment in backbone communication networks under time varying traffic conditions, Second-order properties of the loss probability in \(M/M/s/s+c\) systems

Cites Work

• A Descent Algorithm for the Multihour Sizing of Traffic Networks
• Unnamed Item
• Unnamed Item