Instances and Code of the Paper "The Path-Precedence Constrained Knapsack Problem with Unit Weights: Exact Algorithms, Linear Formulations and Instances"

These files have all the data and code required to reproduce the experiments presented in the paper "The Path-Precedence Constrained Knapsack Problem with Unit Weights: Exact Algorithms, Linear Formulations and Instances". - The file PathPrecedenceConstrainedKnapsack-UnitWeights.ipynb is a Jupyter notebook with all the algorithms and formulations proposed in the paper. - The file instances_ppckp-uw.xlsx has all the instances described in the paper. The first worksheet presents the name of the instances, the capacity value considered and the optimal value obtained. The other worksheets show the data for each instance.