Optimal Network Capacity Planning: A Shortest-Path Scheme

DOI10.1287/OPRE.23.4.810MaRDI QIDQ4065258zbMATH OpenOpenAlexFDO

Authors

Publication date 1975

Published in Operations Research (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sequential estimation (62L12) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Cited in

(8)

• Facility location models for planning a transatlantic communications network
• Heuristics for multi-period capacity expansion in local telecommunications networks
• Multi-period capacity expansion for a local access telecommunications network
• The incremental connected facility location problem
• Multi-facility capacity expansion in R&D projects
• Transmission facility planning in telecommunications networks: A heuristic approach
• Configuring wide area computer networks. Problems and models
• Microcomputer-based algorithms for large scale shortest path problems

This page was built for publication: Optimal Network Capacity Planning: A Shortest-Path Scheme

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