An improved algorithm for decomposing arc flows into multipath flows
From MaRDI portal
Publication:2583709
DOI10.1016/J.ORL.2005.01.005zbMATH Open1080.90079OpenAlexW2018925997MaRDI QIDQ2583709FDOQ2583709
Authors: Donglei Du, Santosh N. Kabadi 
Publication date: 18 January 2006
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.01.005
Recommendations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- A Faster Deterministic Maximum Flow Algorithm
- Network Flow and Testing Graph Connectivity
- Dividing a Graph into Triconnected Components
- Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
- Integer version of the multipath flow network synthesis problem
- On multiroute maximum flows in networks.
- Title not available (Why is that?)
- The multiroute maximum flow problem revisited
- Multi-terminal multipath flows: synthesis
- Flows over edge-disjoint mixed multipaths and applications
Cited In (5)
- Integral flow decomposition with minimum longest path length
- Sensitivity analysis on the all pairs \(q\)-route flows in a network
- An approximation algorithm for multiroute flow decomposition
- Integer version of the multipath flow network synthesis problem
- A fast algorithm of constructing decomposition of multipole flows
This page was built for publication: An improved algorithm for decomposing arc flows into multipath flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583709)
