Open gocklkatz opened 4 months ago
Approach 1: Brute force. n! permutations https://www.geeksforgeeks.org/job-assignment-problem-using-branch-and-bound
Approach 2: Greedy algorithm (heuristic) https://en.wikipedia.org/wiki/Assignment_problem
Generate sample instances of size n
Implement permutation generation and balanced assignment problem solver with arrays
n > 10: generateApSample(n) -> OutOfMemoryError: Java heap space :)
Find existing problem sets with optimal solution on the internet
StopWatch for optimization runs
Implement and solve a balanced assignment problem in Java