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

DOI10.1002/NAV.3800280102MaRDI QIDQ3902801zbMATHOpenAlexWikidataFDO

Authors

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)

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3446196 (Why is no real title available?)
• A Descent Algorithm for the Multihour Sizing of Traffic Networks

Cited in

(9)

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

This page was built for publication: A linear programming model for design of communications networks with time varying probabilistic demands

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902801)