On building minimum cost communication networks

DOI10.1002/NET.3230030404MaRDI QIDQ4154339zbMATH OpenOpenAlexFDO

Authors Norman Zadeh

Publication date 1973

Published in Networks (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35)

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)