Code for solving the NP-hard casting problem (a variant of graph colouring) using heuristics.
The problem description (in Swedish) can be found here.
Code for solving the NP-hard casting problem (a variant of graph colouring) using heuristics.
The problem description (in Swedish) can be found here.