Hungarian Algorithm for Linear Assignment Problems (V2.3)

Version 1.4.0.0 (3.27 KB) by Yi Cao
An extremely fast implementation of the Hungarian algorithm on a native Matlab code.
4.5
(35)
18.4K Downloads
Updated 15 Sep 2011

View License

This is an extremely fast implementation of the famous Hungarian algorithm (aslo known as Munkres' algorithm). It can solve a 1000 x 1000 problem in about 20 seconds in a Core Duo (T2500 @ 2.00GHz) XP laptop with Matlab 2008a, which is about 2.5 times faster than the mex code "assignmentoptimal" in FEX ID 6543, about 6 times faster than the author's first version in FEX ID 20328, and at least 30 times faster than other Matlab implementations in the FEX.

The code can also handle rectangular prolems and problems with forbiden allocations.

The new version (V2.3)is able to conduct a partial assignment if a full assignment is not feasible.

For more details of the Hungarian algorithm, visit http://csclab.murraystate.edu/bob.pilgrim/445/munkres.html

Cite As

Yi Cao (2024). Hungarian Algorithm for Linear Assignment Problems (V2.3) (https://www.mathworks.com/matlabcentral/fileexchange/20652-hungarian-algorithm-for-linear-assignment-problems-v2-3), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2011a
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Version Published Release Notes
1.4.0.0

a bug fixed
1.3.0.0

The new version implements particial assignment if a full assignment is not feasible.
1.2.0.0

Update to improve efficiency further.
1.1.0.0

Bug fix
1.0.0.0