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

DOI10.1002/NAV.3800280102zbMATH Open0454.90030OpenAlexW2078816029WikidataQ107106092 ScholiaQ107106092MaRDI QIDQ3902801FDOQ3902801

Author name not available (Why is that?)

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Descent Algorithm for the Multihour Sizing of Traffic Networks

Cited In (9)

• Equitable transit charges for multi-administration telecommunications networks
• DOMAIN EXTENSIONS OF THE ERLANG LOSS FUNCTION: THEIR SCALABILITY AND ITS APPLICATIONS TO COOPERATIVE GAMES
• A polynomial-time algorithm for message routing in hierarchical communication networks
• On the continued Erlang loss function
• Second-order properties of the loss probability in \(M/M/s/s+c\) systems
• 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
• Routing and capacity assignment in backbone communication networks under time varying traffic conditions

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)