Munkres Assignment Algorithm
Munkres algorithm (also known as Hungarian algorithm) is an efficient algorithm to solve the assignment problem in polynomial-time. The algorithm has many applications in combinatorial optimization, for example in Traveling Salesman problem.
There are a few submissions in the File Exchange for the Munkres algorithm. However, most of them are not efficient. Therefore, I decided to develop my own code. By comparing with existing programms, this code is about two to 5 times faster. For instance, for a 400 x 400 random example, this code can solve it in 4 to 6 seconds, whilst other programs have to take about 17 to 35 seconds.
Cite As
Yi Cao (2020). Munkres Assignment Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/20328-munkres-assignment-algorithm), MATLAB Central File Exchange. Retrieved .
Comments and Ratings (24)
Updates
| 1.0.0.0 | fix a bug to handle nan elements. |
|
fix a bug |
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Acknowledgements
Inspired by: assignprob.zip, Functions for the rectangular assignment problem
Inspired: Hungarian Algorithm for Linear Assignment Problems (V2.3), LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0, K-Best Assignment Algorithm
Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
This looks like an old version of this submission by same author:
https://au.mathworks.com/matlabcentral/fileexchange/20652-hungarian-algorithm-for-linear-assignment-problems-v2-3
How do I cite your implementation of the algorithm?
Well, though the bug I previously reported that occures in assignmentsuboptimal1 & assignmentsuboptimal2. The assignmentoptimal function implementation is very very good! Thank you for your great work!
Hello, I am trying to assign projects to students, they are 20 and they have 5 choices of projects for which they gave a list of preference. I am looking for the best algorithm and try to understand how it works, I have no experience in programmation, at all, could someone help me understanding how I am supposed to insert inputs in the algorithm? Is it the right one actually?
Thanks so much for your help.
Hello, Yi Cao
Thank you for uploading Munkres algorithm. However, as this assignment is only for Minimum assignment, If i want to assign for Maximum assignment then what changes needs to be done in your code?
Suppose matrix [2, 4, 6;8, 6, 10;12, 14, 20]
Min. Assignment is 24. But If I want to Max. assignment then?
Thank you in Advance.
Is it possible for you explain the commands how it is perform here? Need to understand whole program. I m new to matlab and programming.
Bug: fails for input row vector [5 4 3 1].
Fix(?): validCol = any(validMat, 1); (dimension for any is not specified in the original code for validCol.)
Hi people,
I a question about the hungarian algorithm. this algorithm is optimal algorithm for the assignment problem, and the time complexity is O(n^3), right?
But , if the input is the multidimensional matrix, it's possible to use the hungarian algorithm? how does it change the algorithm and the time complexity ?
thanks
There is another version of this package here: http://www.mathworks.com/matlabcentral/fileexchange/20652-hungarian-algorithm-for-linear-assignment-problems-v2-3
there is no solution for the following matrix?
1 4 Inf
Inf Inf 5
Inf Inf 7
How do I modify such that it provides the
assignment =
1 0 0
0 0 1
0 0 0
I have a 15x51 matrix on which this algorithm fails. the JV handles it.
can I send you the matrix
This is much faster than the version 1.0. Thanks!
Hi,
i have also a cost matrix which returns zero assignments while the Hungarian (http://www.mathworks.com/matlabcentral/fileexchange/11609-hungarian-algorithm) algorithm works fine...
Hi
I have a cost matrix for which this script does not seem to work. It seems to make random assignments where the candidate has maximum costs (inf). Could you help?
but i have a question
is the time complexity of your algorithm on the order of n^3 or n^4?
Yi,
There was a problem with my data, that did not occur in any of my other cases.
Thanks again!
Kevin
Kevin,
Thanks for comments. I have looked at your problem. Actually, the problem does not have a valid solution. The code you linked does not provide a valid solution either. If you check the solution, you will find many zeros, which means no valid assignment can be done for these positions.
HTH
Yi
This is extremely fast compared to the other Hungarian algorithms I've seen posted here.
I have successfully used this many times to optimally connect line segments such that the total cost is minimized.
However, I did find a case in which the assignment matrix does not return any matches, but some of the slower algorithms do.
For example, i got results using Markus Buehren's algorithm at
http://www.mathworks.com/matlabcentral/fileexchange/6543
My distance matrix is found here:
http://www.bigfoot.com/~Kevin.Crosby/public/distance.mat
Do you have a quick fix for this?
Thanks!
Truly excellent. It has everything you could ask of a Matlab program: good structure, excellent comments, simplicity, flow and efficiency. Thank you for sharing.