Simple Constructions for Multiterminal Network Flow Synthesis
From MaRDI portal
Publication:4740356
DOI10.1137/0212010zbMath0504.90083OpenAlexW2055310760MaRDI QIDQ4740356
Publication date: 1983
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0212010
sensitivity analysiscombinatorial optimizationplanar graphsgraph algorithmsnetwork designmulti-terminal network flow synthesissimpler algorithms
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Sensitivity, stability, parametric optimization (90C31) Deterministic network models in operations research (90B10)
Related Items (3)
On the robustness of potential-based flow networks ⋮ Integer version of the multipath flow network synthesis problem ⋮ Multiroute flows: cut-trees and realizability
This page was built for publication: Simple Constructions for Multiterminal Network Flow Synthesis