On this page, instances for the the Min-Max selection problem under discrete uncertainty set could be found. In addition, information with regard to the size of instances provided as well as an overall description of the considered method of instance generation is available. For more general purposes, the instance generator software is also accessible through a github repository. Finally, if more detail about theory or application of this method is desired, the main publication introducing this method could also be reached.

It must be noticed that in order to refer to the parameters of the robust selection problem, we use n for the number of items, p for the number of items we need to choose and N for the number of scenarios.

Method description: For all i ∈ [n] and j ∈ [N], we choose cij ∈ {1, . . . , 100} iid uniformly.

Instance Format

The instance set here consists of four datasets. In dataset1, we consider the pairs (20, 11), (25, 13), (30, 15), (35, 17) and (40, 21) for (n, p) and set N = n in all cases. In dataset2, we fix n = N = 30 but change p ∈ {5, 11, 15, 21, 25}. In dataset3, we fix n = 30 and p = 15 but change N ∈ {5, 10, 15, 20, 25, 30, 35, 40}. Finally, dataset4 considers large-scale problems with N ∈ {100, 500, 1000, 5000, 10000} also using n = 30 and p = 15. In addition, each dataset has different number of folders. These folders are named as “minmax-n-p-N-0-0” and contain 50 separate instances with the same size. In addition, each instance file contains N+1 lines. The first line represents n, p, N and the remaining lines forms N given scenarios, including n item costs.

Generator Software

Although it is a good idea to have a library of instances for the robust optimization problems, it is not possible to upload all possible combination of problem parameters on a website. Alternatively, the generator software could be accessed so that any instance size could be generated. Therefore, it is possible to access a C++11 code which is used as the generator software.


This page has been created based on the information provided in the following paper:

  • Goerigk, M., & Khosravi, M. (2022). Benchmarking Problems for Robust Discrete Optimization. arXiv preprint arXiv:2201.04985.