We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (A P, E) with weights on the edges in E, and with lower and upper quotas on the vertices in P.We seek a maximum weight many-to-one matching satisfying two sets of...

We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (A P, E) with weights on the edges in E, and with lower and upper quotas on the vertices in P.We seek a maximum weight many-to-one matching satisfying two sets of...