On building minimum cost communication networks
From MaRDI portal
Publication:4154339
DOI10.1002/net.3230030404zbMath0375.90029MaRDI QIDQ4154339
Publication date: 1973
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230030404
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
65K05: Numerical mathematical programming methods
90B10: Deterministic network models in operations research
Related Items
A survey of dynamic network flows, An algorithm for the min concave cost flow problem, Concave cost minimization on networks, Design of private backbone networks. I: Time varying traffic, A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, A decomposition method for the min concave cost flow problem with a staircase structure, LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY, Engpässe, Staustellen und glatte homogene Ströme in Netzen
Cites Work