Hungarian algorithm for linear sum assignment. Works for square and rectangular cost matrices.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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)
Cite As
ondrejdee (2026). Hungarian Algorithm for Linear Sum Assignment Problem (https://github.com/ondrejdee/hungarian), GitHub. Retrieved .
Acknowledgements
Inspired by: Hungarian Algorithm for Linear Assignment Problems (V2.3), LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0
General Information
- Version 1.0.0.0 (120 KB)
-
View License on GitHub
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
Versions that use the GitHub default branch cannot be downloaded
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
specified where the graphs are.
|
