Network synthesis with few edges

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199603)27:2<109::AID-NET2>3.0.CO;2-O" /><109::AID-NET2>3.0.CO;2-O 10.1002/(SICI)1097-0037(199603)27:2<109::AID-NET2>3.0.CO;2-OzbMath0851.90035OpenAlexW1979836460MaRDI QIDQ4887739

Kalyan T. Talluri

Publication date: 5 August 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199603)27:2<109::aid-net2>3.0.co;2-o

zbMATH Keywords

lower boundnetwork synthesis

Mathematics Subject Classification ID

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

Related Items (4)

Multi-terminal multipath flows: synthesis ⋮ 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: Network synthesis with few edges