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)
Citar como
ondrejdee (2026). Hungarian Algorithm for Linear Sum Assignment Problem (https://github.com/ondrejdee/hungarian), GitHub. Recuperado .
Compatibilidad con la versión de MATLAB
Compatibilidad con las plataformas
Windows macOS LinuxCategorías
Etiquetas
Agradecimientos
Inspirado por: Hungarian Algorithm for Linear Assignment Problems (V2.3), LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0
Descubra Live Editor
Cree scripts con código, salida y texto formateado en un documento ejecutable.
speed_comparison
No se pueden descargar versiones que utilicen la rama predeterminada de GitHub
| Versión | Publicado | Notas de la versión | |
|---|---|---|---|
| 1.0.0.0 |
specified where the graphs are.
|
|
