Modified bipartite matching for multiobjective optimization

In graph theory, the Hungarian algorithm can provide the maximum weighted bipartite matching for assignment problems. In this paper, a modified bipartite matching (MBM) algorithm is proposed for multiobjective optimization. This algorithm can be widely used to solve the weighted bipartite matching problem with multiobjective optimization. We illustrate the application of MBM to antenna assignments in wireless MIMO system. The simulation results show that MBM enjoys low computational complexity and maximizes the system capacity, while keeping the fairness among mobile users.