论文信息 - Variants of the Hungarian Method for Assignment Problems' - 字舞流文

Variants of the Hungarian Method for Assignment Problems'

The author p r e s e n t s a geometrical modelwhich illuminates variants of the Hungarian method for the solution of the assignment problem.

H. W. Kuhn B R Y N Mawr College

[1] H. Kuhn. The Hungarian method for the assignment problem , 1955 .

[2] D. R. Fulkerson,et al. A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.

[3] M. M. Flood. The Traveling-Salesman Problem , 1956 .

[4] Marshall Hall,et al. An Algorithm for Distinct Representatives , 1956 .

[5] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .