Open GoogleCodeExporter opened 9 years ago
Looks like the Hungarian algorithm is a way to solve this
(http://en.wikipedia.org/wiki/Hungarian_algorithm)
Original comment by brianfromoregon
on 4 Jun 2010 at 2:45
I tested out a couple of implementations found here:
http://timefinder.svn.sourceforge.net/viewvc/timefinder/trunk/timefinder-
algo/src/main/java/de/timefinder/algo/roomassignment/
They don't practically scale well to n=thousands, too slow. Googling shows a
few
papers on monte carlo based approximation algorithms which may be the best bet.
Original comment by brianfromoregon
on 5 Jun 2010 at 4:21
Another way of stating the problem: given a MxN weighted-edge biclique, find a
minimal assignment (as in the assignment problem).
I hope there's an approximation solution, maybe using monte-carlo simulations.
Original comment by brianfromoregon
on 25 Jun 2010 at 2:07
Original issue reported on code.google.com by
brianfromoregon
on 1 Jun 2010 at 11:30