scholarly journals Two strongly polynomial cut cancelling algorithms for minimum cost network flow

1993 ◽  
Vol 46 (2) ◽  
pp. 133-165 ◽  
Author(s):  
Thomas R. Ervolina ◽  
S.Thomas McCormick
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.


2001 ◽  
Vol 33 (3) ◽  
pp. 591-604
Author(s):  
Carlos E. Testuri ◽  
Richard L. Kilmer ◽  
Thomas Spreen

AbstractThis study provides insight into the seasonality of Class I price differentials in the southeastern dairy industry. This is accomplished by analyzing monthly estimates of Class I price differentials obtained from the imputed price solution or dual solution of a generalized capacitated minimum cost network flow model of the dairy industry. A smooth seasonal pattern emerges through the monthly sequence with the lowest and highest estimated Class I price differentials occurring in April and September respectively. Miami and Jacksonville areas reach $ 5.40 and $ 4.36 per hundredweight in April and $ 6.79 and $ 5.53 per hundredweight in September.


Sign in / Sign up

Export Citation Format

Share Document