An improved algorithm for decomposing arc flows into multipath flows

DOI10.1016/j.orl.2005.01.005zbMath1080.90079OpenAlexW2018925997MaRDI QIDQ2583709

Santosh N. Kabadi, Dong-lei Du

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

zbMATH Keywords

arc flowmultipath flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items (4)

Integral flow decomposition with minimum longest path length ⋮ An approximation algorithm for multiroute flow decomposition ⋮ Sensitivity analysis on the all pairsq-route flows in a network ⋮ Integer version of the multipath flow network synthesis problem

Cites Work

• Integer version of the multipath flow network synthesis problem
• Multi-terminal multipath flows: synthesis
• Flows over edge-disjoint mixed multipaths and applications
• On multiroute maximum flows in networks
• Network Flow and Testing Graph Connectivity
• A Faster Deterministic Maximum Flow Algorithm
• Dividing a Graph into Triconnected Components
• Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
• The multiroute maximum flow problem revisited
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved algorithm for decomposing arc flows into multipath flows