This site contains a (Linux) release of the algorithm CFS for the Knapsack problem with Conflicts (KPC) described in the following paper:
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts by Stefano Coniglio, Fabio Furini and Pablo San Segundo. European Journal of Operational Research, 289(2), 435-455 (2021).
This software is for academic purposes only, see also the file LICENSE provided.
The instances employed in the tests are provided in the instances folder, in their original format.
The Linux binary is available in the bin folder (instructions for use are inside), with a few sample instances.