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

Standard

A survey on exact algorithms for the maximum flow and minimum-cost flow problems. / Cruz Mejía, Oliverio; Letchford, Adam.
In: Networks, Vol. 82, No. 2, 30.09.2023, p. 167-176.

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

Harvard

Cruz Mejía, O & Letchford, A 2023, 'A survey on exact algorithms for the maximum flow and minimum-cost flow problems', Networks, vol. 82, no. 2, pp. 167-176. https://doi.org/10.1002/net.22169

APA

Cruz Mejía, O., & Letchford, A. (2023). A survey on exact algorithms for the maximum flow and minimum-cost flow problems. Networks, 82(2), 167-176. https://doi.org/10.1002/net.22169

Vancouver

Cruz Mejía O, Letchford A. A survey on exact algorithms for the maximum flow and minimum-cost flow problems. Networks. 2023 Sept 30;82(2):167-176. Epub 2023 Jun 20. doi: 10.1002/net.22169

Author

Cruz Mejía, Oliverio ; Letchford, Adam. / A survey on exact algorithms for the maximum flow and minimum-cost flow problems. In: Networks. 2023 ; Vol. 82, No. 2. pp. 167-176.

Bibtex

@article{a8be3930553a4bfd81e2673519b7f839,
title = "A survey on exact algorithms for the maximum flow and minimum-cost flow problems",
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.",
keywords = "combinatorial optimisation, network flows",
author = "{Cruz Mej{\'i}a}, Oliverio and Adam Letchford",
year = "2023",
month = sep,
day = "30",
doi = "10.1002/net.22169",
language = "English",
volume = "82",
pages = "167--176",
journal = "Networks",
issn = "0028-3045",
publisher = "Blackwell-Wiley",
number = "2",

}

RIS

TY - JOUR

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

AU - Cruz Mejía, Oliverio

AU - Letchford, Adam

PY - 2023/9/30

Y1 - 2023/9/30

N2 - 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.

AB - 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.

KW - combinatorial optimisation

KW - network flows

U2 - 10.1002/net.22169

DO - 10.1002/net.22169

M3 - Review article

VL - 82

SP - 167

EP - 176

JO - Networks

JF - Networks

SN - 0028-3045

IS - 2

ER -