Computing a many-to-many matching with demands and capacities between two sets using the Hungarian algorithm
Data Structures and Algorithms
2022-11-04 v1
Abstract
Given two sets A={a_1,a_2,...,a_s} and {b_1,b_2,...,b_t}, a many-to-many matching with demands and capacities (MMDC) between A and B matches each element a_i in A to at least \alpha_i and at most \alpha'_i elements in B, and each element b_j in B to at least \beta_j and at most \beta'_j elements in A for all 1=<i<=s and 1=<j<=t. In this paper, we present an algorithm for finding a minimum-cost MMDC between A and B using the well-known Hungarian algorithm.
Cite
@article{arxiv.2211.01612,
title = {Computing a many-to-many matching with demands and capacities between two sets using the Hungarian algorithm},
author = {Fatemeh Rajabi-Alni and Alireza Bagheri},
journal= {arXiv preprint arXiv:2211.01612},
year = {2022}
}
Comments
8 pages, 1 figure