# UflLib

## Uniform Benchmarks

Similar instances: Bilde-Krarup, Koerkel-Ghosh

These benchmarks were generated by Kochetov and Ivanenko [1]. Opening costs for each of the n facilities is set to 3000. Connection costs for the m = n
customers is drawn uniformly at random from the interval [0, 10000]. For the present instances n was chosen to be 100.

More details are available at Sobolev Institute of Mathematics, where the instances are available for download in a different data format. The UflLib package contains the same instances in the simple data format.

### References

[1] |
Yu. Kochetov and D. Ivanenko.Computationally Difficult Instances for the Uncapacitated Facility Location Problem.In: T. Iberaki, K. Nonobe, Y. Musunori (eds.), Metaheuristics: Progress as Real Problem Solvers, Chapter 16, pp. 351-367, 2005. |