On building minimum cost communication networks
From MaRDI portal
Publication:4154339
Cited in
(9)- A survey of dynamic network flows
- Concave cost minimization on networks
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Design of private backbone networks. I: Time varying traffic
- An algorithm for the min concave cost flow problem
- A decomposition method for the min concave cost flow problem with a staircase structure
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
- LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
- Engpässe, Staustellen und glatte homogene Ströme in Netzen
This page was built for publication: On building minimum cost communication networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154339)