A survey on exact algorithms for the maximum flow and minimum-cost flow problems

Cruz Mejía, Oliverio and Letchford, Adam (2023) A survey on exact algorithms for the maximum flow and minimum-cost flow problems. Networks, 82 (2). pp. 167-176. ISSN 0028-3045

Text (netflow-survey)
netflow_survey.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (346kB)

Abstract

Network flow problems form an important and much‐studied family of combinatorial optimization problems, with a huge array of practical applications. Two network flow problems in particular have received a great deal of attention: the maximum flow and minimum‐cost flow problems. We review the progress that has been made on exact solution algorithms for these two problems, with an emphasis on worst‐case running times.