## Abstract

We propose the first combinatorial solution to the generalized minimum cost flow problem (flow with losses and gains). Despite a rich history dating back to Kantorovich and Dantzig, until now, the only known way to solve the problem in polynomial-time was via general-purpose linear programming techniques. Polynomial combinatorial algorithms were previously known only for the version of our problem without costs. We design the first such algorithms for the version with costs. Our algorithms also find provably good solutions faster than optimal ones, providing the first strongly polynomial approximation schemes for the problem. Our techniques extend to optimize linear programs with two variables per inequality. Polynomial combinatorial algorithms were previously developed for testing the feasibility of such linear programs. We propose the first such methods for the optimization version.

Original language | English (US) |
---|---|

Pages (from-to) | 445-459 |

Number of pages | 15 |

Journal | Mathematics of Operations Research |

Volume | 27 |

Issue number | 3 |

DOIs | |

State | Published - Aug 2002 |

## All Science Journal Classification (ASJC) codes

- General Mathematics
- Computer Science Applications
- Management Science and Operations Research

## Keywords

- Gain factor
- Generalized minimum cost flow
- Minimum cost flow
- Polynomial combinatorial algorithm
- Strongly polynomial approximation scheme