Minimum cost flow‐dependent communication networks

DOI10.1002/NET.20118MaRDI QIDQ5487822zbMATH OpenOpenAlexDBLPWikidataFDO

Authors D. A. Thomas, J. F. Weng

Publication date 12 September 2006

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

communication networkSteiner treeGilbert networkflow-dependent network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)

Recommendations

• Flow-dependent networks: Existence and behavior at Steiner points
• The Gilbert arborescence problem
• A model for the design of a minimum-cost telecommunications network
• Augmenting Euclidean Networks—the Steiner Case
• Pseudo-Gilbert-Steiner trees

Cited in

(6)

• Minimax problem of suppressing a communication network
• The Gilbert arborescence problem
• Computing Steiner points and probability Steiner points in \(\ell _{1}\) and \(\ell _{2}\) metric spaces
• Maximising the worth of nascent networks
• Computing Steiner points for gradient-constrained minimum networks
• Flow-dependent networks: Existence and behavior at Steiner points

This page was built for publication: Minimum cost flow‐dependent communication networks

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