# A Strongly Polynomial Algorithm for Generalized Flow Maximization

@article{Vgh2017ASP, title={A Strongly Polynomial Algorithm for Generalized Flow Maximization}, author={L{\'a}szl{\'o} A. V{\'e}gh}, journal={Math. Oper. Res.}, year={2017}, volume={42}, pages={179-211} }

- Published in Math. Oper. Res. 2017
DOI:10.1287/moor.2016.0800

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. As a consequence of the result, we also obtain a strongly polynomial algorithm for the linear feasibility problem with at most two nonzero entries per… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-7 OF 7 CITATIONS

## A simpler and faster strongly polynomial algorithm for generalized flow maximization

VIEW 10 EXCERPTS

CITES BACKGROUND, METHODS & RESULTS

HIGHLY INFLUENCED

## A theory of flow network typings and its optimization problems

VIEW 1 EXCERPT

CITES BACKGROUND

## Shortest path and maximum flow problems in planar flow networks with additive gains and losses

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 35 REFERENCES

## Monotonizing linear programs with up to two nonzeroes per column

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## A faster strongly polynomial minimum cost flow algorithm

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL

## Concave Generalized Flows with Applications to Market Equilibria

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## Max flows in O(nm) time, or better

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL

## Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## A Faster Combinatorial Algorithm for the Generalized Circulation Problem

VIEW 13 EXCERPTS

HIGHLY INFLUENTIAL

## Combinatorial Algorithms for the Generalized Circulation Problem

VIEW 13 EXCERPTS

HIGHLY INFLUENTIAL

## Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS( Network Design, Control and Optimization)

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL