Multicommodity flows in tree-like networks
From MaRDI portal
Publication:733946
Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 910908 (Why is no real title available?)
- scientific article; zbMATH DE number 912071 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- An O (n 2 (m + N log n )log n ) min-cost flow algorithm
- Approximate max-integral-flow/min-multicut theorems
- Beyond the flow decomposition barrier
- Efficient schemes for nearest neighbor load balancing
- Finding Minimum-Cost Circulations by Successive Approximation
- Multicriterial multi-index resource scheduling problems
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Two-Commodity Flow
Cited in
(15)- Heterogeneous multi-commodity network flows over time
- Multicommodity Flows in Ring Networks
- A fixed-parameter tractability result for multicommodity demand flow in trees
- scientific article; zbMATH DE number 3848941 (Why is no real title available?)
- Cycle-based reducibility of multi-index transport-type systems of linear inequalities
- scientific article; zbMATH DE number 1927152 (Why is no real title available?)
- Multiindex transportation problems with 2-embedded structure
- Three-index linear programs with nested structure
- A minimum cost algorithm for multicommodity flow traffic networks which have same convey cost
- Multicommodity flows in cycle graphs
- Substitutes, Complements and Ripples in Network Flows
- Minimax flow tree problems
- Multi-index transport problems with decomposition structure
- Product Multicommodity Flow in Wireless Networks
- Designing multi-commodity flow trees
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)