论文信息 - AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"

AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"

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.

M. Iri | N. Tomizawa

[1] H. Whitney. On the Abstract Properties of Linear Dependence , 1935 .

[2] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[5] Egon Balas,et al. DUALITY IN DISCRETE PROGRAMMING , 1967 .

[6] D. Welsh. Kruskal's theorem for matroids , 1968, Mathematical Proceedings of the Cambridge Philosophical Society.

[7] 伊理正夫,et al. Network flow, transportation and scheduling : theory and algorithms , 1969 .

[8] Dominic Welsh,et al. On Matroid Theorems of Edmonds and Rado , 1970 .

[9] N. Tomizawa,et al. On some techniques useful for solution of transportation network problems , 1971, Networks.

[10] Louis Weinberg,et al. The principal minors of a matroid , 1971 .

[11] Robin J. Wilson,et al. An Introduction to Matroid Theory , 1973 .