Attempting to find solutions to memory-intensive problems, using heuristics to save on computation time.
Completed problems:
- knapsack (branch and bound)
- sudoku solving (simple cp)
- graph coloring (greedy)
- TSP (local search + greedy)
- facility location (mip)