AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
1976 年 19 巻 1 号 p. 32-57
詳細
1976 年 19 巻 1 号 p. 32-57
The ordinary assignment problem on a bipartite graph with weighted arcs is extended to the case where both of the two sets of vertices of the graph are given matroidal structures, and a practical solution algorithm is presented to this extended problem.
