knapsack base
Basic greedy solver
Basic dynamic programming solver
Memory consumption greatly reduced, parallel for using openmp
Initial files for graph coloring...
Working with a greedy constraint programming algorithm
Introduced state
Added setColor function to state
Working branching, works well for 50 vertices, not so much for 70
Working cliques, need lot of optimization
Cleaner code, cliques optimized
SetColor needs some optimization, pretty good otherwise
Works well for optimality up to 70_7, too slow for others
Fixed greedy algorithm
Good local search after greedy. Got all 10s with this version of local search
Added some comments