For constraint programming, various experiments on variants have been performed.
Approximation: One approximation algorithm has been implemented.
Heuristics: Greedy and Random.
You can find detailed experiments in [./experiments](./experiments).
Each of the 27 experiment is located in a separate subfolder, containing a description in a README.md, a file to run the experiment, a file to analyse the experiment, as well as the data.