ISSN:
1436-4646
Keywords:
Network optimization
;
Assignment problem
;
Algorithms
;
Experimental evaluation
;
Cost scaling
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01585996
Permalink