Sika! Kotala na sekele
Beta
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.
Gekopieerd 
Bekijk gecachete versie
Uw zoekopdracht en dit resultaat
- De zoekterm verschijnt in het resultaat: python find element in list
- De website komt overeen met een of meer van uw zoektermen
- Andere websites met uw zoektermen linken naar dit resultaat
- Het resultaat is in Nederlands
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.
Wikipedia
