K-Best Assignment Algorithm
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
Cita come
Eric Trautmann (2024). K-Best Assignment Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/30837-k-best-assignment-algorithm), MATLAB Central File Exchange. Recuperato .
Compatibilità della release di MATLAB
Compatibilità della piattaforma
Windows macOS LinuxTag
Riconoscimenti
Ispirato da: Munkres Assignment Algorithm, LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Scopri Live Editor
Crea script con codice, output e testo formattato in un unico documento eseguibile.
Murty k-best assignment/
Versione | Pubblicato | Note della release | |
---|---|---|---|
1.0.0.0 |