You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hey, I'm a Computer Science student (in my last semester), and recently I've implemented an improved version of the well-known Munkers algorithm by backtracking as a part of my last course at the University.
This improved version is also faster than the original one and also gives the option of assigning each agent to more than 1 task, and each task to more than 1 agent.
@MightyArty I must confess that I have not been actively maintaining this library for awhile. I'm happy to merge your changes into this repo and publish a new version. However, here's another option: You can take over maintenance of it. (Call it munkres2 or something.)
If you're interested, of course. :-)
I originally developed this thing as part of a coding test for an employer back in 2008. I pushed it to pypy more or less on a whim. I rarely actually use it myself.
Hey, I'm a Computer Science student (in my last semester), and recently I've implemented an improved version of the well-known Munkers algorithm by backtracking as a part of my last course at the University.
This improved version is also faster than the original one and also gives the option of assigning each agent to more than 1 task, and each task to more than 1 agent.
The link for the paper research on which my code is based:
https://www.sciencedirect.com/science/article/pii/S0304397516000037?ref=pdf_download&fr=RR-2&rr=89adcd6b4d2ae3c7
Below is the comparison in the running time:
The size indicates a randomly generated matrix with sizes from 5 to 800.
I would like to contribute my implementation to this library if it's possible.
Thanks, would be glad to hear from you.
You can reach me at my email as well: [email protected]
The text was updated successfully, but these errors were encountered: