Efficient Partitioning and Matching Algorithm for Weighted Bipartite Graphs

The proposed Fast Iterative Match-Partition Hybrid Genetic Algorithm (FIMP-HGA) significantly enhances solution quality and reduces runtime compared to the state-of-the-art MPLS algorithm for the Partitioning Min-Max Weighted Matching (PMMWM) problem.