Code and Data Repository for A Bilevel Optimization Approach for a Class of Combinatorial Problems with Disruptions and Probing

The "data" folder contains all the datasets used in the paper, including the shortest path networks in DIMACS format and the project selection (knapsack) problem instances. For the project selection problem instances, the files display the nominal profits, the weigths, and the right-hand-side coefficient. The name of the files present the size (network size for shortest path and number of items for knapsack) as well as the random seed used for its generation (a number between 0 and 9 corresponding to each one of the ten replicas per configuration).