| Article ID: | iaor199558 |
| Country: | Netherlands |
| Volume: | 14 |
| Issue: | 2 |
| Start Page Number: | 99 |
| End Page Number: | 109 |
| Publication Date: | Sep 1993 |
| Journal: | Operations Research Letters |
| Authors: | Tuy Hoang, Ding Dan Nguyen, Ghannadan Saied |
| Keywords: | networks: flow |
A parametric method is proposed for solving a special production-transportation problem with two factories, and the minimum concave cost flow problem on a single source uncapacitated network with a single nonlinear arc cost. The resulting algorithms are strongly polynomial. The algorithm for the network flow problem is an improved version of an earlier polynomial algorithm of Guisewite and Pardalos.