An Efficient Cost Scaling Algorithm for the Assignment Problem (1995)
Cached
Download Links
- [www.eecs.umich.edu]
- [theory.stanford.edu]
- DBLP
Other Repositories/Bibliography
by
Andrew V. Goldberg
,
Robert Kennedy
| Venue: | MATH. PROGRAM |
| Citations: | 24 - 1 self |
BibTeX
@ARTICLE{Goldberg95anefficient,
author = {Andrew V. Goldberg and Robert Kennedy},
title = {An Efficient Cost Scaling Algorithm for the Assignment Problem},
journal = {MATH. PROGRAM},
year = {1995},
volume = {71},
pages = {153--177}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem and investigate implementations of the method that take advantage of assignment's special structure. The results show that the method is very promising for practical use.
