Multicommodity flows in tree-like networks

DOI10.1134/S106423070802007XzbMath1173.49026OpenAlexW2093466946MaRDI QIDQ733946

M. Kh. Prilutskii, L. G. Afraimovich

Publication date: 19 October 2009

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s106423070802007x

zbMATH Keywords

multicommodity minimum-cost flowstree-like networks

Mathematics Subject Classification ID

Linear programming (90C05) Applications of graph theory to circuits and networks (94C15) Linear optimal control problems (49N05)

Related Items (4)

Cycle-based reducibility of multi-index transport-type systems of linear inequalities ⋮ Multiindex transportation problems with 2-embedded structure ⋮ Three-index linear programs with nested structure ⋮ Multi-index transport problems with decomposition structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multicriterial multi-index resource scheduling problems
• Primal-dual approximation algorithms for integral flow and multicut in trees
• Beyond the flow decomposition barrier
• Finding Minimum-Cost Circulations by Successive Approximation
• Approximate max-integral-flow/min-multicut theorems
• An O (n ² (m + N log n )log n ) min-cost flow algorithm
• Two-Commodity Flow
• Efficient schemes for nearest neighbor load balancing

This page was built for publication: Multicommodity flows in tree-like networks