sandipde / Hungarian-Murty

Implementation of Murty's 1968 algorithm to find k best costs of a given assignment matrix (http://pubsonline.informs.org/doi/abs/10.1287/opre.16.3.682)

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Hungarian-Murty

Implementation of Murty's 1968 algorithm to find k best costs of a given assignment matrix (http://pubsonline.informs.org/doi/abs/10.1287/opre.16.3.682) The algorithm can work with any algorithm to find best cost in principle but in this case the hungarian method implementation by Lars Buitinck has been used.

About

Implementation of Murty's 1968 algorithm to find k best costs of a given assignment matrix (http://pubsonline.informs.org/doi/abs/10.1287/opre.16.3.682)

License:GNU General Public License v2.0


Languages

Language:Python 100.0%