Polynomial-time primal simplex algorithms for the minimum cost network flow problem

Algorithmica ◽  
1992 ◽  
Vol 8 (1-6) ◽  
pp. 145-160 ◽  
Author(s):  
Donald Goldfarb ◽  
Jianxiu Hao
Keyword(s):  
Polynomial Time ◽  
Network Flow ◽  
Flow Problem ◽  
Minimum Cost ◽  
Network Flow Problem ◽  
Minimum Cost Network Flow

scholarly journals Minimum cost network flows: Problems, algorithms, and software

2013 ◽  
Vol 23 (1) ◽  
pp. 3-17 ◽  
Author(s):  
Angelo Sifaleras
Keyword(s):  
Network Flow ◽  
Flow Problem ◽  
Network Flows ◽  
Minimum Cost ◽  
Network Flow Problem ◽  
Software Packages ◽  
Wide Range ◽  
Solution Methods ◽  
Minimum Cost Network Flow ◽  
Algorithmic Approaches

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.

An exterior simplex type algorithm for the Minimum Cost Network Flow Problem

2009 ◽  
Vol 36 (4) ◽  
pp. 1176-1190 ◽  
Author(s):  
Konstantinos Paparrizos ◽  
Nikolaos Samaras ◽  
Angelo Sifaleras
Keyword(s):  
Network Flow ◽  
Flow Problem ◽  
Minimum Cost ◽  
Network Flow Problem ◽  
Type Algorithm ◽  
Minimum Cost Network Flow
Sign in / Sign up

Export Citation Format

Share Document