Network synthesis with few edges
From MaRDI portal
DOI10.1002/(SICI)1097-0037(199603)27:2%3C109::AID-NET2%3E3.0.CO;2-OzbMATH Open0851.90035OpenAlexW1979836460MaRDI QIDQ4887739FDOQ4887739
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
Recommendations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cited In (13)
- On-line network synthesis
- Problems of synthesis of connected networks with respect to isomorphic subgraphs
- On half-integrality of network synthesis problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the robustness of potential-based flow networks
- On integer network synthesis problem with tree-metric cost
- Title not available (Why is that?)
- Integer exact network synthesis problem
- Multi-terminal multipath flows: synthesis
- The network synthesis problem in a cycle
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887739)