K-Best Assignment Algorithm

Implementation of Murty's algorithm for a ranked list of best assignment solutions.


Updated 23 Mar 2011

View License

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

Implementations of Munkres and JV algorithms by Yi Cao can be found here:

Munkres: http://www.mathworks.com/matlabcentral/fileexchange/20328

JV: http://www.mathworks.com/matlabcentral/fileexchange/26836

Cite As

Eric Trautmann (2023). K-Best Assignment Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/30837-k-best-assignment-algorithm), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2010b
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