A new algorithm for the assignment problem
暂无分享,去创建一个
[1] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[2] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[3] Richard S. Hatch. Technical Note - Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms , 1975, Oper. Res..
[4] Gerald G. Brown,et al. Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .
[5] Darwin Klingman,et al. The alternating basis algorithm for assignment problems , 1977, Math. Program..
[6] Darwin Klingman,et al. Letter to the Editor - Comments on a Note by Hatch on Network Algorithms , 1978, Oper. Res..
[7] A. Ohuchi,et al. AN ALGORITHM FOR THE HITCHCOCK TRANSPORTATION PROBLEMS WITH QUADRATIC COST FUNCTIONS , 1981 .
[8] Leon F. McGinnis,et al. Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem , 1983, Oper. Res..