Hungarian Algorithm for Linear Sum Assignment Problem
Hungarian algorithm for linear sum assignment. Works for square as well as rectangular cost matrices
(thus, for the common example of matching M workers to N tasks, M can be different from N.)
The speed is compared to two other existing matlab implementations.
This implementation seems to have an edge for rectangular cost matrices; for the tested problems it runs more than 10x faster (see graphs on github: https://github.com/ondrejdee/hungarian)
Cita come
ondrejdee (2026). Hungarian Algorithm for Linear Sum Assignment Problem (https://github.com/ondrejdee/hungarian), GitHub. Recuperato .
Compatibilità della release di MATLAB
Compatibilità della piattaforma
Windows macOS LinuxCategorie
Tag
Riconoscimenti
Ispirato da: Hungarian Algorithm for Linear Assignment Problems (V2.3), LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0
Scopri Live Editor
Crea script con codice, output e testo formattato in un unico documento eseguibile.
speed_comparison
Le versioni che utilizzano il ramo predefinito di GitHub non possono essere scaricate
| Versione | Pubblicato | Note della release | |
|---|---|---|---|
| 1.0.0.0 |
specified where the graphs are.
|
|
