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)
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.
Item Type:
Journal Article
Journal or Publication Title:
Networks
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700/1705
Subjects:
?? combinatorial optimisationnetwork flowscomputer networks and communicationsinformation systems ??
Departments:
ID Code:
194935
Deposited By:
Deposited On:
31 May 2023 14:40
Refereed?:
Yes
Published?:
Published
Last Modified:
11 Aug 2024 00:40