The cost scaling push-relabel method has been shown to be efficient fo
r solving minimum-cost Row problems. In this paper we apply the method
to the assignment problem and investigate implementations of the meth
od that take advantage of assignment's special structure. The results
show that the method is very promising for practical use.