Efficient algorithms for the maximum concurrent flow problem

DOI10.1002/net.21572zbMath1390.90053OpenAlexW2052542396MaRDI QIDQ4642463

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

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 generationdecompositionscombinatorial algorithmsparsest cutmaximum 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)

Related Items (1)

Bounds on maximum concurrent flow in random bipartite graphs

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