
Munkres Assignment Algorithm 1.0 File ID: 79405 


 Munkres Assignment Algorithm 1.0 License: Freeware File Size: 10.0 KB Downloads: 98
Submit Rating: 



Munkres Assignment Algorithm 1.0 Description 

Description: Munkres algorithm (also known as Hungarian algorithm) is an efficient algorithm to solve the assignment problem in polynomialtime. 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.
License: Freeware Related: comparing, existing, programms, Develop, decided, times, whilst, Programs, seconds, Random, faster, instance, Exchange, submissions, solve, assignment, Algorithm O/S:BSD, Linux, Solaris, Mac OS X File Size: 10.0 KB Downloads: 98


More Similar Code 

This implementation is based on the 1968 Murty algorithm for finding a ranked list of the best assignments for an arbitrary cost matrix.
This algorithm uses a usersupplied assignment algorithm, such as the Munkres (Hungarian) algorithm or the JV algorithm to obtain an arbitrary number of best assignment solutions.
Implementations of Munkres and JV algorithms by Yi Cao can be found here:
Munkres:...
The JonkerVolgenant algorithm is much faster than the famous Hungarian algorithm for the Linear Assignment Problem (LAP). This Matlab implementation is modified from the original C++ code made by Roy Jonker, one of the inventors of the algorithm....
This is an extremely fast implementation of the famous Hungarian algorithm (aslo known as Munkres' algorithm). The new version (V2.2)is about 1.5 times faster than the old version (V2.1). It can solve a 1000 x 1000 problem in about 20 seconds in a...
With this package, I provide some MATLABfunctions regarding the rectangular assignment problem. This problem appears for example in tracking applications, where one has M existing tracks and N new measurements. For each possible assignment, a...
"Hungarian algorithm" to solve the square assignment problem (original & pure MATLAB implementation). The Hungarian algorithm can also be used as a subsolver in a B&B solver for the travelling salesman problem.
How to...
auction_match: Compute optimal (maximal) weighted assignment and the corresponding "lattice of dual prices" supporting the optimal assignment. auction_match(disMatrix) computes the optimal assignment for the given...
This function uses the auction principle to return the optimal assignment and the dual prices. It performs quite well, and is way faster than the hungarian algorithm as the number of points increases. More details on the auction algorithm can be...
This demonstration shows the single steps of nearest neighbour, hungarian method (munkres algorithm) for assignment problem, branch and bound for symetric cost matrices. The tree of the branch and bound algorithm is shown and the user can select...
This is a search algorithm but what makes it different is that it checks if the data you are looking for in the data matrix. if it is, it returns the position of it and the value at that position. if what you are searching for is not in the data...
This is an evolutionary algorithm that returns a random list of prime numbers. This code is highly inefficient for a reason. This algorithm is more of a proof of concept that if a prime was a heritable trait, it would not be a desired one. 
User Review for Munkres Assignment Algorithm 
