Network synthesis with few edges

DOI10.1002/(SICI)1097-0037(199603)27:2%3C109::AID-NET2%3E3.0.CO;2-OMaRDI QIDQ4887739zbMATH OpenOpenAlexFDO

Authors Kalyan Talluri

Publication date 5 August 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199603)27:2%3C109::aid-net2%3E3.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)

Recommendations

• The network synthesis problem in a cycle
• Publication:4862214
• 2-commodity integer network synthesis problem
• On half-integrality of network synthesis problem
• Integer version of the multipath flow network synthesis problem

Cited in

(13)

• The network synthesis problem in a cycle
• Problems of synthesis of connected networks with respect to isomorphic subgraphs
• On integer network synthesis problem with tree-metric cost
• scientific article; zbMATH DE number 3878637 (Why is no real title available?)
• Integer version of the multipath flow network synthesis problem
• On the robustness of potential-based flow networks
• Multiroute flows: cut-trees and realizability
• On-line network synthesis
• Multi-terminal multipath flows: synthesis
• scientific article; zbMATH DE number 841993 (Why is no real title available?)
• On half-integrality of network synthesis problem
• Integer exact network synthesis problem
• scientific article; zbMATH DE number 4085692 (Why is no real title available?)

This page was built for publication: Network synthesis with few edges

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