A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
Networks · 2023-09 · 82 (2) · 167-176
DOI: 10.1002/net.22169 ↗Kurz gefasst
Fachartikel in der Zeitschrift Networks, online erschienen am 20.06.2023. Verfasst von Oliverio Cruz‐Mejía und 1 weiteren Autor:innen. Die Arbeit wurde bisher 25-mal zitiert (Crossref) und nennt 79 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Cruz‐Mejía, O., & Letchford, A. N. (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 AN. A survey on exact algorithms for the maximum flow and minimum‐cost flow problems. Networks. 2023;82(2):167-176. doi:10.1002/net.22169
BibTeX
@article{CruzMeja2023,
author = {Cruz‐Mejía, Oliverio and Letchford, Adam N.},
title = {A survey on exact algorithms for the maximum flow and minimum‐cost flow problems},
journal = {Networks},
year = {2023},
volume = {82},
number = {2},
pages = {167--176},
doi = {10.1002/net.22169}
}
EUVIMED