A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Multiobjective optimized bipartite matching for resource allocation
2007
2007 International Symposium on Communications and Information Technologies
The Hungarian algorithm can provide the maximum weighted bipartite matching for assignment problems. However it can only solve the single objective weight optimization problem. In this paper, a modified bipartite matching (MBM) algorithm is proposed to solve the weighted bipartite matching problem with multiobjective optimization. In addition, our MBM algorithm is applicable to asymmetric bipartite graph, which is common in resource allocation problems. We illustrate the application of MBM to
doi:10.1109/iscit.2007.4392101
fatcat:ue5ajzfx3rgtrp6sxtxj2d3paq