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)
Zitieren als
ondrejdee (2024). Hungarian Algorithm for Linear Sum Assignment Problem (https://github.com/ondrejdee/hungarian), GitHub. Abgerufen.
Kompatibilität der MATLAB-Version
Plattform-Kompatibilität
Windows macOS LinuxKategorien
Tags
Quellenangaben
Inspiriert von: Hungarian Algorithm for Linear Assignment Problems (V2.3), LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Live Editor erkunden
Erstellen Sie Skripte mit Code, Ausgabe und formatiertem Text in einem einzigen ausführbaren Dokument.
speed_comparison
Versionen, die den GitHub-Standardzweig verwenden, können nicht heruntergeladen werden
Version | Veröffentlicht | Versionshinweise | |
---|---|---|---|
1.0.0.0 |
specified where the graphs are.
|
|