On building minimum cost communication networks
From MaRDI portal
Publication:4154339
DOI10.1002/net.3230030404zbMath0375.90029OpenAlexW2085809786MaRDI QIDQ4154339
Publication date: 1973
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230030404
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY ⋮ A Lagrangean heuristic for the capacitated concave minimum cost network flow problem ⋮ A decomposition method for the min concave cost flow problem with a staircase structure ⋮ An algorithm for the min concave cost flow problem ⋮ A survey of dynamic network flows ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ Engpässe, Staustellen und glatte homogene Ströme in Netzen ⋮ Concave cost minimization on networks ⋮ Design of private backbone networks. I: Time varying traffic
Cites Work
This page was built for publication: On building minimum cost communication networks
