论文标题
使用匈牙利算法计算两组之间的需求和能力，计算多到多的匹配
Computing a many-to-many matching with demands and capacities between two sets using the Hungarian algorithm
论文作者
论文摘要
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 α_i and at most α'_i elements in B, and each element b_j in B to at least β_j and at most a的β'_j元素在A中均为1 = <i <= s和1 = <j <= t。在本文中，我们提出了一种使用著名的匈牙利算法在A和B之间找到最低成本MMDC的算法。
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 α_i and at most α'_i elements in B, and each element b_j in B to at least β_j and at most β'_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.
