K-Best Assignment Algorithm

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

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