Instances for the recoverable selection problem under discrete uncertainty set could be found on this page. Here, we use n, p, N and k when referring to the number of items, number of items one wants to choose, number of scenarios and recovery parameter, respectively.
Method description: will be updated soon.
The first four numbers used to label each instance file represent n, p, N 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 N+2 lines. The first line demonstrates n, p, N, k. The second line is a n-vector representing cost of each item in the first stage and the remaining lines illustrate N different scenarios including n item costs in the second stage.
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).