| Article ID: | iaor19941868 |
| Country: | Netherlands |
| Volume: | 59 |
| Issue: | 1 |
| Start Page Number: | 117 |
| End Page Number: | 132 |
| Publication Date: | Mar 1993 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Tamir Arie |
| Keywords: | programming: network |
The authors present strongly polynomial algorithms to find rational and integer flow vectors that minimize a convex separable quadratic cost function on two-terminal series-parallel graphs.