A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem

DOI10.1137/1.9781611974317.13zbMath1429.68343OpenAlexW2266515814MaRDI QIDQ5232554

Andreas Karrenbauer, Maximilian Fickert, Ruben Becker

Publication date: 12 September 2019

Published in: 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974317.13

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

This page was built for publication: A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem