About
Code for solving the NP-hard casting problem (a variant of graph colouring) using heuristics.
Problem Description
The problem description (in Swedish) can be found here.
Heuristics for creating casts with the minimum amount of actors.
Code for solving the NP-hard casting problem (a variant of graph colouring) using heuristics.
The problem description (in Swedish) can be found here.
Heuristics for creating casts with the minimum amount of actors.