On Implementing the Push—Relabel Method for the Maximum Flow Problem
- Cite this article as:
- Cherkassky, B. & Goldberg, A. Algorithmica (1997) 19: 390. doi:10.1007/PL00009180
- 571 Downloads
We study efficient implementations of the push—relabel method for the maximum flow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementations: we show that the highest-level selection strategy gives better results when combined with both global and gap relabeling heuristics. We also exhibit a family of problems for which the running time of all implementations we consider is quadratic.