A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Multiple Hungarian Method for k-Assignment Problem
2020
Mathematics
The k-assignment problem (or, the k-matching problem) on k-partite graphs is an NP-hard problem for k≥3. In this paper we introduce five new heuristics. Two algorithms, Bm and Cm, arise as natural improvements of Algorithm Am from (He et al., in: Graph Algorithms And Applications 2, World Scientific, 2004). The other three algorithms, Dm, Em, and Fm, incorporate randomization. Algorithm Dm can be considered as a greedy version of Bm, whereas Em and Fm are versions of local search algorithm,
doi:10.3390/math8112050
fatcat:nsciq6nhjnhttlgxnqnhljefri