An Efficient Implementation Of A Scaling Minimum-Cost Flow Algorithm (1992)
| Venue: | Journal of Algorithms |
| Citations: | 84 - 7 self |
BibTeX
@ARTICLE{Goldberg92anefficient,
author = {Andrew V. Goldberg},
title = {An Efficient Implementation Of A Scaling Minimum-Cost Flow Algorithm},
journal = {Journal of Algorithms},
year = {1992},
volume = {22},
pages = {1--29}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. The scaling push-relabel method is an important theoretical development in the area of minimum-cost flow algorithms. We study practical implementations of this method. We are especially interested in heuristics which improve real-life performance of the method. Our implementation works very well over a wide range of problem classes. In our experiments, it was always competitive with the established codes, and usually outperformed these codes by a wide margin. Some heuristics we develop may apply to other network algorithms. Our experimental work on the minimum-cost flow problem motivated theoretical work on related problems. Supported in part by ONR Young Investigator Award N00014-91-J-1855, NSF Presidential Young Investigator Grant CCR-8858097 with matching funds from AT&T and DEC, Stanford University Office of Technology Licensing, and a grant form the Powell Foundation. 1 1. Introduction. Significant theoretical progress has been made recently in the area of minimum-cost flow ...
