A computational study of the capacity scaling algorithm for the maximum flow problem

DOI10.1016/j.cor.2012.02.003zbMath1251.90068OpenAlexW2006297927MaRDI QIDQ1761224

Cenk Çalışkan

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.02.003

zbMATH Keywords

computational complexitynetwork flowsmaximum flowaugmenting pathcapacity scaling

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Computational investigations of maximum flow algorithms
• On implementing the push-relabel method for the maximum flow problem
• A generalization of the scaling max-flow algorithm
• Beyond the flow decomposition barrier
• A new approach to the maximum-flow problem
• AO(nm log(U/n)) time maximum flow algorithm
• Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems

This page was built for publication: A computational study of the capacity scaling algorithm for the maximum flow problem