Hungarian Algorithm for Linear Sum Assignment Problem

Version 1.0.0.0 (120 KB) by ondrejdee
Hungarian algorithm for linear sum assignment. Works for square and rectangular cost matrices.
5.0
(1)
555 Downloads
Updated 17 May 2017
View License on GitHub

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 .

MATLAB Release Compatibility
Created with R2011b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Genomics and Next Generation Sequencing in Help Center and MATLAB Answers
Tags Add Tags

speed_comparison

Versions that use the GitHub default branch cannot be downloaded

Version Published Release Notes
1.0.0.0

specified where the graphs are.
corrected squre -> cost
Improved description
To view or report issues in this GitHub add-on, visit the GitHub Repository.
To view or report issues in this GitHub add-on, visit the GitHub Repository.