K-Best Assignment Algorithm
Implementation of Murty's algorithm for a ranked list of best assignment solutions.
Al momento, stai seguendo questo contributo
- Vedrai gli aggiornamenti nel tuo feed del contenuto seguito
- Potresti ricevere delle email a seconda delle tue preferenze per le comunicazioni
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 (2026). K-Best Assignment Algorithm (https://it.mathworks.com/matlabcentral/fileexchange/30837-k-best-assignment-algorithm), MATLAB Central File Exchange. Recuperato .
Riconoscimenti
Ispirato da: Munkres Assignment Algorithm, LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0
Informazioni generali
- Versione 1.0.0.0 (4,29 KB)
Compatibilità della release di MATLAB
- Compatibile con qualsiasi release
Compatibilità della piattaforma
- Windows
- macOS
- Linux
| Versione | Pubblicato | Note della release | Action |
|---|---|---|---|
| 1.0.0.0 |
