Description

Instances for the Recoverable selection problem under discrete budgeted uncertainty set could be found on this page. Here, we use n, p, Г and k when referring to the number of items, number of items one wants to choose, budget to control the amount of uncertainty and recovery parameter, respectively. Furthermore, cost of each item must be chosen from a given interval; thus, we use the n-vectors c and d to show the lower bound and the deviation of the correspondence interval.

Method description: will be updated soon.

Download Instance

Instance Format

The first four numbers used to label each instance file represent n, p, Г and k in the exact same order. In addition, the last number shows the instance number with the given size. For each considered size 50 instances are generated. The instance files contain four lines. The first line demonstrates n, p, Г and k. The second line depicts the first stage cost of items. The third and fourth lines illustrate the n-vectors c and d, respectively.

Output

Generator

Download Generator on Github

Reference

The information on this page has been created based on the paper “Benchmarking Problems for Robust Discrete Optimization” by Dr. Marc Goerigk (Network and Data Science Management, University of Siegen, Germany) and Mohammad Khosravi (Network and Data Science Management, University of Siegen, Germany).