Abstract
We propose a new algorithm for the max-flow problem. It consists of a sequence of augmentations along paths constructed by an auction-like algorithm. These paths are not necessarily shortest, that is, they need not contain a minimum number of arcs. However, they can be found typically with much less computation than the shortest augmenting paths used by competing methods. Our algorithm outperforms these latter methods as well as state-of-the-art preflow-push algorithms by a very large margin in tests with standard randomly generated problems.
Original language | English (US) |
---|---|
Pages (from-to) | 69-101 |
Number of pages | 33 |
Journal | Journal of Optimization Theory and Applications |
Volume | 87 |
Issue number | 1 |
DOIs | |
State | Published - Oct 1995 |
Externally published | Yes |
Keywords
- Network optimization
- auction algorithms
- max-flow problems
- preflow-push algorithms
ASJC Scopus subject areas
- Control and Optimization
- Management Science and Operations Research
- Applied Mathematics