Optimal Network Capacity Planning: A Shortest-Path Scheme
From MaRDI portal
Publication:4065258
DOI10.1287/opre.23.4.810zbMath0307.90026OpenAlexW2108897741MaRDI QIDQ4065258
No author found.
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
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Sequential estimation (62L12)
Related Items (8)
Heuristics for multi-period capacity expansion in local telecommunications networks ⋮ Facility location models for planning a transatlantic communications network ⋮ Configuring wide area computer networks. Problems and models ⋮ Multi-period capacity expansion for a local access telecommunications network ⋮ Multi-facility capacity expansion in R&D projects ⋮ The incremental connected facility location problem ⋮ Transmission facility planning in telecommunications networks: A heuristic approach ⋮ Microcomputer-based algorithms for large scale shortest path problems
This page was built for publication: Optimal Network Capacity Planning: A Shortest-Path Scheme
