ALGORITHMS AND COMPLEXITY ANALYSIS FOR SOME FLOW PROBLEMS

Several network-flow problems with additional constraints are considered. They are all special cases of the linear-programming problem and are shown to be P-complete. It is shown that the existence of a strongly polynomial-time algorithm for any of these problems implies the existence of such an algorithm for the general linear-programming problem. On the positive side, strongly polynomial algorithms for some parametric flow problems are given, when the number of parameters is fixed. These algorithms are applicable to constrained flow problems when the number of additional constraints is fixed.