Finding Minimum-cost Circulations by Canceling Negative Cycles

Abstract

A classical algorithm for finding a minimum-cost circultaion consists of repeatedly finding a residual cycle of negative cost and canceling it by pushing enough flow around the cycle to saturate an arc. We show that a judicious choice of cycles for canceling leads to a polynomial bound on the number of iterations in this algorithm. This gives a very simple strongly polynomial algorithm that uses no scaling. A variant of the algorithm that uses dynamic trees runs in O(nm(log n)min{log(nC),mlogn}) time on a network of n verticies, m arcs, and arc costs of maximum absolute value C. This bound is comparable to those of the fastest previously known algorithms.