| Article ID: | iaor19971052 |
| Country: | Netherlands |
| Volume: | 71 |
| Issue: | 2 |
| Start Page Number: | 153 |
| End Page Number: | 177 |
| Publication Date: | Dec 1995 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Goldberg Andrew V., Kennedy Robert |
The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper the authors 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.