Computing a Many-to-Many Matching with Demands and Capacities between Two Sets Using the Hungarian Algorithm

Fatemeh Rajabi-Alni, Alireza Bagheri and Ching-Feng Wen

Journal of Mathematics, 2023, vol. 2023, 1-6

Abstract: A many-to-many matching (MM) between two sets matches each element of one set to at least one element of the other set. A general case of the MM is the many-to-many matching with demands and capacities (MMDC) satisfying given lower and upper bounds on the number of elements matched to each element. In this article, we give a polynomial-time algorithm for finding a minimum-cost MMDC between two sets using the well-known Hungarian algorithm.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2023/7761902.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2023/7761902.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:7761902

DOI: 10.1155/2023/7761902

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().