Flow-dependent networks: Existence and behavior at Steiner points

DOI10.1002/(SICI)1097-0037(199805)31:3%3C149::AID-NET1%3E3.0.CO;2-FMaRDI QIDQ4540042zbMATH OpenOpenAlexFDO

Authors Christopher Cox

Publication date 21 July 2002

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199805)31:3%3C149::aid-net1%3E3.0.co;2-f

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Minimum cost flow‐dependent communication networks
• Interconnecting networks in the plane: The steiner case
• scientific article; zbMATH DE number 3850794
• The Gilbert arborescence problem
• Augmenting Euclidean Networks—the Steiner Case

Cited in

(4)

• Motorway junctions as steiner points in a density field and generalizations
• The Gilbert arborescence problem
• Minimum cost flow‐dependent communication networks
• Cost-minimizing networks among immiscible fluids in \({\mathbb{R}}^2\)

This page was built for publication: Flow-dependent networks: Existence and behavior at Steiner points

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