K-Best Assignment Algorithm
Implementation of Murty's algorithm for a ranked list of best assignment solutions.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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 (2026). K-Best Assignment Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/30837-k-best-assignment-algorithm), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired by: Munkres Assignment Algorithm, LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0
General Information
- Version 1.0.0.0 (4.29 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
