Home > Research > Publications & Outputs > A survey on exact algorithms for the maximum fl...

Research

Associated organisational unit

Electronic data

  • netflow-survey

    Accepted author manuscript, 338 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

Keywords

View graph of relations

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

Research output: Contribution to Journal/Magazine › Review article › peer-review

Published
Close
More...
<mark>Journal publication date</mark>30/09/2023
<mark>Journal</mark>Networks
Issue number2
Volume82
Number of pages10
Pages (from-to)167-176
Publication StatusPublished
Early online date20/06/23
<mark>Original language</mark>English

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.