Threshold assignment algorithm
暂无分享,去创建一个
[1] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[2] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[3] D. Koenig. Theorie Der Endlichen Und Unendlichen Graphen , 1965 .
[4] T. L. Saaty,et al. Finite graphs and networks : an introduction with applications , 1967 .
[5] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[6] Darwin Klingman,et al. NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .
[7] Darwin Klingman,et al. The alternating basis algorithm for assignment problems , 1977, Math. Program..
[8] Ming S. Hung,et al. Solving the Assignment Problem by Relaxation , 1980, Oper. Res..
[9] M. Engquist. A Successive Shortest Path Algorithm for The Assignment Problem , 1982 .