A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series—parallel networks

1993 ◽  
Vol 59 (1-3) ◽  
pp. 117-132 ◽  
Author(s):  
Arie Tamir
Optimization ◽  
1995 ◽  
Vol 32 (1) ◽  
pp. 23-43 ◽  
Author(s):  
H. Tuy ◽  
S. Ghannadan ◽  
A. Migdalas ◽  
P. VÄrbrand

1996 ◽  
Vol 72 (3) ◽  
pp. 229-258 ◽  
Author(s):  
Hoang Tuy ◽  
Saied Ghannadan ◽  
Athanasios Migdalas ◽  
Peter Värbrand

2019 ◽  
Vol 36 (1-2) ◽  
pp. 51-59
Author(s):  
Urmila Pyakurel

In this paper, we investigate the minimum cost flow problem in two terminal series parallel network. We present modified minimum cost flow algorithm that computes the maximum dynamic and the earliest arrival flows in strongly polynomial time and also preserves all unused arc capacities. We also present strongly polynomial time minimum cost partial contraflow algorithm that solves both problems with partial reversals of arc capacities on two terminal series parallel networks.


Sign in / Sign up

Export Citation Format

Share Document