A primal algorithm for solving a capacitated network flow problem with additional linear constraints

Networks ◽  
1977 ◽  
Vol 7 (1) ◽  
pp. 59-79 ◽  
Author(s):  
S. Chen ◽  
R. Saigal
2018 ◽  
Vol 64 ◽  
pp. 105-114 ◽  
Author(s):  
Jean-François Baffier ◽  
Pierre-Louis Poirion ◽  
Vorapong Suppakitpaisarn

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.


Sign in / Sign up

Export Citation Format

Share Document