Faster Jonker-Volgenant Assignment Algorithm

Versión 1.1.0.0 (4,76 KB) por Eric Trautmann
This is a modification made to Yi Cao's original JV algorithm code to improve speed.
3.0
(2)
1K Descargas
Actualizado 3 jul 2012

Ver licencia

This updated version performs the JV algorithm for a standard assignment problem for only valid entries in the cost matrix.

The modification removes rows and columns of the matrix where all values are inf, which is useful for applications where it is necessary to mask off certain assignments, such as in the k-best assignment algorithm (Murty algorithm).

The improvement in the runtime is dependent upon how many rows/cols are masked, but can be as 7-20x for many cases.

Yi Cao agreed to let me post this update, and the majority of the code is his.

Citar como

Eric Trautmann (2024). Faster Jonker-Volgenant Assignment Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/30838-faster-jonker-volgenant-assignment-algorithm), MATLAB Central File Exchange. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R2010b
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versión Publicado Notas de la versión
1.1.0.0

Thanks to Mark Tincknell for submitting an update to generalize this for arbitrary rectangular matrices.
1.0.0.0