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.
-
Notifications
You must be signed in to change notification settings - Fork 3
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
sandipde/Hungarian-Murty
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
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)
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published