Pseudo paradox in minimum cost network flow problem

2017 ◽  
Vol 30 (2) ◽  
pp. 220
Author(s):  
N.A. Sonia ◽  
Ankit Khandelwal
2013 ◽  
Vol 23 (1) ◽  
pp. 3-17 ◽  
Author(s):  
Angelo Sifaleras

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.


2009 ◽  
Vol 36 (4) ◽  
pp. 1176-1190 ◽  
Author(s):  
Konstantinos Paparrizos ◽  
Nikolaos Samaras ◽  
Angelo Sifaleras

Sign in / Sign up

Export Citation Format

Share Document