Efficient algorithms for the maximum concurrent flow problem

DOI10.1002/NET.21572MaRDI QIDQ4642463zbMATH OpenOpenAlexFDO

Authors Pierre-Olivier Bauguion, Walid Ben-Ameur, Eric Gourdin

Publication date 23 May 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21572

zbMATH Keywords

shortest pathcolumn generationcombinatorial algorithmsparsest cutdecompositionsmaximum concurrent flowtree-based formulation

Mathematics Subject Classification ID

Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Microeconomic theory (price theory and economic markets) (91B24)

Recommendations

• Approximation Algorithms for the Maximum Concurrent Flow Problem
• scientific article; zbMATH DE number 65738
• The maximum concurrent flow problem
• Max concurrent flow problem
• Processor-efficient implementation of a maximum flow algorithm
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
• Maximum concurrent flows and minimum cuts
• A combinatorial approximation algorithm for concurrent flow problem and its application
• A Faster Deterministic Maximum Flow Algorithm

Cited in

(4)

• Bounds on maximum concurrent flow in random bipartite graphs
• A combinatorial approximation algorithm for concurrent flow problem and its application
• Maximum concurrent flow with incomplete data
• Approximation Algorithms for the Maximum Concurrent Flow Problem

This page was built for publication: Efficient algorithms for the maximum concurrent flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642463)