Integer Programming and Combinatorial Optimization

Volume 920 of the series Lecture Notes in Computer Science pp 157-171


On implementing push-relabel method for the maximum flow problem

  • Boris V. CherkasskyAffiliated withCentral Institute for Economics and Mathematics
  • , Andrew V. GoldbergAffiliated withComputer Science Department, Stanford University

* Final gross prices may vary according to local VAT.

Get Access


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 also exhibit a family of problems for which the running time of all known methods seem to have a roughly quadratic growth rate.