On building minimum cost communication networks over time

DOI10.1002/NET.3230040104zbMATH Open0284.90031OpenAlexW1997939774MaRDI QIDQ4770741FDOQ4770741

Authors: Norman Zadeh 

Publication date: 1974

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230040104

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (13)

• Facility location models for planning a transatlantic communications network
• The DT-polynomial approach to discrete time-varying network flow problems
• Heuristics for multi-period capacity expansion in local telecommunications networks
• A heuristic approach for capacity expansion of packet networks
• Concave cost minimization on networks
• Multi-period capacity expansion for a local access telecommunications network
• The incremental connected facility location problem
• Call admission control schemes and ATM network topological design
• A survey of dynamic network flows
• Transmission facility planning in telecommunications networks: A heuristic approach
• An algorithm for the min concave cost flow problem
• Configuring wide area computer networks. Problems and models
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms

This page was built for publication: On building minimum cost communication networks over time

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