A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks

• Authors:

• Arie Tamir

• Affiliations:

• -

• Venue:
• Mathematical Programming: Series A and B
• Year:
• 1993