Munkres

Algorithm::Munkres is a Perl extension for Munkres solution to classical Assignment problem for square and rectangular matrices. This module extends the solution of Assignment problem for square matrices to rectangular matrices by padding zeros. Thus a rectangular matrix is converted to square...


Platforms: *nix

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...


Platforms: Matlab

The Jonker-Volgenant 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. It is about 10 times faster than the munkres code...


Platforms: Matlab

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 Core Duo (T2500 @ 2.00GHz) XP laptop with Matlab...


Platforms: Matlab

With this package, I provide some MATLAB-functions 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 cost or distance is computed. All cost values form a...


Platforms: Matlab

This is Markus Buehren's code re-packaged to work in Simulink. I use it with Global Nearest Neighbour data association method. Any problems with the actual algorithm should be addressed to Markus. Any problems with the Simulink port, please let me know. Thanks Markus.This file runs happily in the...


Platforms: Matlab

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 user-supplied assignment algorithm, such as the Munkres (Hungarian) algorithm or the JV algorithm to obtain an arbitrary number of best...


Platforms: Matlab

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 rectangular value matrix, for example the assignment of bidders (in rows) to...


Platforms: Matlab

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 more or less details. With the file 4 examples are...


Platforms: Matlab