The Partitioning MinMax Weighted Matching Problem
We introduce the Partitioning MinMax Weighted Matching Problem (PMMWM). PMMWM combines a maximum matching and a partitioning problem. Applications arise in the field of intermodal container terminals and sea ports. We prove strong NP-hardness of PMMWM. We present two heuristic frameworks and an extensive computational study.
partitioning maximum matching assignment bipartite graph container transshipment