Flows over edge-disjoint mixed multipaths and applications

DOI10.1016/j.dam.2007.05.001zbMath1278.90056OpenAlexW1965641578MaRDI QIDQ2381819

K. P. K. Nair, R. Chandrasekaran, Santosh N. Kabadi, Yash P. Aneja

Publication date: 19 September 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.001

zbMATH Keywords

max-flow min-cut theoremnetwork synthesismultipath flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

Sensitivity analysis on the all pairsq-route flows in a network ⋮ Parametric multiroute flow and its application to multilink-attack network ⋮ Integer version of the multipath flow network synthesis problem ⋮ Unnamed Item ⋮ An improved algorithm for decomposing arc flows into multipath flows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integer version of the multipath flow network synthesis problem
• Ratio combinatorial programs
• Optimal wavelength-routed multicasting
• Parametric min-cuts analysis in a network.
• Multi-terminal multipath flows: synthesis
• On multiroute maximum flows in networks
• Multi-Terminal Network Flows
• Integer Solution to Synthesis of Communication Networks
• Maximizing residual flow under an arc destruction

This page was built for publication: Flows over edge-disjoint mixed multipaths and applications