Computing a Many-to-Many Matching with Demands and Capacities between Two Sets Using the Hungarian Algorithm
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....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2023/7761902 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|