A strongly polynomial algorithm for generalized flow maximization

A strongly polynomial algorithm is given for the generalized flow maximization problem. It uses a new variant of the scaling technique, called continuous scaling. The main measure of progress is that within a strongly polynomial number of steps, an arc can be identified that must be tight in every dual optimal solution, and thus can be contracted.

Authors

• László A. Végh

Keywords

• combinatorial algorithms
• generalized flows
• linear programming
• strongly polynomial algorithms