| Article ID: | iaor1988222 |
| Country: | France |
| Volume: | 21 |
| Issue: | 3 |
| Start Page Number: | 205 |
| End Page Number: | 217 |
| Publication Date: | Aug 1987 |
| Journal: | RAIRO Operations Research |
| Authors: | Pasche C. |
To solve network flow problems with piecewise linear convex cost function with efficiency, a specific algorithm must be used. A modified network simplex method is developed; the pivoting strategy used allows several flow modifications in one pivot. Computational experiments, on two types of problems, show the efficiency of this new pivot operation.