新功能！私密瀏覽
測試版
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods.It was developed and published in 1955 by Harold Kuhn, who gave it the name "Hungarian method" because the algorithm was largely based on the earlier works of two Hungarian mathematicians, Dénes Kőnig and Jenő Egerváry.
已複製 
查看快取版本
您的搜尋與此結果
- 該 搜尋詞 出現在結果中: operators in java example program
- 該網站符合您的其中一個或多個搜尋詞
- 其他包含您的搜尋詞的網站鏈接到此結果
- 結果的語言是 中文 (台灣)
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods.It was developed and published in 1955 by Harold Kuhn, who gave it the name "Hungarian method" because the algorithm was largely based on the earlier works of two Hungarian mathematicians, Dénes Kőnig and Jenő Egerváry.
維基百科
