Minimum cost network flows: Problems, algorithms, and software
Abstract
We present a wide range of problems concerning minimum cost network flows, and give an overview of the classic linear single-commodity Minimum Cost Network Flow Problem (MCNFP) and some other closely related problems, either tractable or intractable. We also discuss state-of-the-art algorithmic approaches and recent advances in the solution methods for the MCNFP. Finally, optimization software packages for the MCNFP are presented.
Published
Oct 11, 2016
How to Cite
SIFALERAS, A..
Minimum cost network flows: Problems, algorithms, and software.
Yugoslav Journal of Operations Research, [S.l.], v. 23, n. 1, oct. 2016.
ISSN 2334-6043.
Available at: <http://www.yujor.fon.bg.ac.rs/index.php/yujor/article/view/401>. Date accessed: 07 may 2024.
Section
Articles
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.