| Article ID: | iaor2006588 |
| Country: | China |
| Volume: | 24 |
| Issue: | 4 |
| Start Page Number: | 751 |
| End Page Number: | 757 |
| Publication Date: | Nov 2004 |
| Journal: | Journal of Mathematical Research and Exposition |
| Authors: | Dong Zhenning, Liu Jiazhuang |
We study an uncapacitated version of the minimum cost flow problem (both one-commodity and two-commodity) with fixed costs and variable costs, and give them each a polynomial algorithm. We solve an example of an uncapacitated two-commodity minimum cost flow problem with the algorithm.