On building minimum cost communication networks over time
From MaRDI portal
Publication:4770741
DOI10.1002/net.3230040104zbMath0284.90031OpenAlexW1997939774MaRDI QIDQ4770741
Publication date: 1974
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230040104
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Related Items (13)
Heuristics for multi-period capacity expansion in local telecommunications networks ⋮ An algorithm for the min concave cost flow problem ⋮ Facility location models for planning a transatlantic communications network ⋮ A survey of dynamic network flows ⋮ Configuring wide area computer networks. Problems and models ⋮ Multi-period capacity expansion for a local access telecommunications network ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ The DT-polynomial approach to discrete time-varying network flow problems ⋮ Concave cost minimization on networks ⋮ Call admission control schemes and ATM network topological design ⋮ A heuristic approach for capacity expansion of packet networks ⋮ The incremental connected facility location problem ⋮ Transmission facility planning in telecommunications networks: A heuristic approach
Cites Work
This page was built for publication: On building minimum cost communication networks over time
