Multicommodity flows in tree-like networks
From MaRDI portal
Publication:733946
DOI10.1134/S106423070802007XzbMATH Open1173.49026OpenAlexW2093466946MaRDI QIDQ733946FDOQ733946
Authors: L. G. Afraimovich, M. Kh. Prilutskii
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
Recommendations
Linear programming (90C05) Applications of graph theory to circuits and networks (94C15) Linear optimal control problems (49N05)
Cites Work
- Title not available (Why is that?)
- Beyond the flow decomposition barrier
- Finding Minimum-Cost Circulations by Successive Approximation
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Multicriterial multi-index resource scheduling problems
- An O (n 2 (m + N log n )log n ) min-cost flow algorithm
- Title not available (Why is that?)
- Efficient schemes for nearest neighbor load balancing
- Approximate max-integral-flow/min-multicut theorems
- Two-Commodity Flow
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Three-index linear programs with nested structure
- Title not available (Why is that?)
- Designing multi-commodity flow trees
- Multicommodity Flows in Ring Networks
- Product Multicommodity Flow in Wireless Networks
- Title not available (Why is that?)
- Multi-index transport problems with decomposition structure
- Substitutes, Complements and Ripples in Network Flows
- Multicommodity flows in cycle graphs
- Minimax flow tree problems
- A fixed-parameter tractability result for multicommodity demand flow in trees
- Cycle-based reducibility of multi-index transport-type systems of linear inequalities
- Multiindex transportation problems with 2-embedded structure
- Heterogeneous multi-commodity network flows over time
- A minimum cost algorithm for multicommodity flow traffic networks which have same convey cost
This page was built for publication: Multicommodity flows in tree-like networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733946)