Instances for the minmax selection problem under budgeted uncertainty set could be found on this page. Here, we use n, p and Г when referring to the number of items, number of items one wants to choose and budget to control the amount of uncertainty, 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.
The first three numbers used to label each instance file represent n, p and Г 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 three lines. The first line demonstrates n, p and Г. The second and third lines illustrate the n-vectors c and d, respectively.
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).