[BOOK][B] On implementing scaling push-relabel algorithms for the minimum-cost flow problem
AV Goldberg, M Kharitonov - 1992 - wwwdimacs.dimacs.rutgers.edu
AV Goldberg, M Kharitonov
1992•wwwdimacs.dimacs.rutgers.eduThe invention of the scaling push-relabel method is an important theoretical development in
the area of minimum-cost ow algorithms. In this paper we study implementations of this
method. We are especially interested in heuristics that improve the performance of the
algorithms in practice. Our results show that the technique works well on several problem
classes with very di erent network structure. We also nd a problem class on which the
method does not perform as well and suggest directions for further improvement.
the area of minimum-cost ow algorithms. In this paper we study implementations of this
method. We are especially interested in heuristics that improve the performance of the
algorithms in practice. Our results show that the technique works well on several problem
classes with very di erent network structure. We also nd a problem class on which the
method does not perform as well and suggest directions for further improvement.
Abstract
The invention of the scaling push-relabel method is an important theoretical development in the area of minimum-cost ow algorithms. In this paper we study implementations of this method. We are especially interested in heuristics that improve the performance of the algorithms in practice. Our results show that the technique works well on several problem classes with very di erent network structure. We also nd a problem class on which the method does not perform as well and suggest directions for further improvement.
wwwdimacs.dimacs.rutgers.edu
Showing the best result for this search. See all results