%0 Journal Article
%T Minimum cost network flows: Problems, algorithms, and software
%A Sifaleras Angelo
%J Yugoslav Journal of Operations Research
%D 2013
%I University of Belgrade
%R 10.2298/yjor121120001s
%X 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.
%K Mathematical Programming
%K Combinatorial Optimization
%K Optimization Software
%U http://www.doiserbia.nb.rs/img/doi/0354-0243/2013/0354-02431300001S.pdf