Discrete location problems 
Benchmark library
Test
instances. Class R2d
For
this class of instances the set of candidate sites and the set of
clients are equal to the set of
vertices of the graph
shown on the 
Fig. 1.
m = n = 25.
Clients'
preferences are determened with distances in the graph.
Facility with lower
number is more preferable in the case of tie. Value pij is equal to bj
for all i.
Parameters'
values are random integer from following intervals:
bj from [6,12];
fi from [25,30];
gi from [15,20].
Input data
format:
each
string contains only one value;
parameters are given in the following order: m,
n, (rij) line by line[1],
pij line by line, fi , gi.
[1]
for example,
elements of 2x2-matrix A
will be ordered as follows: a11, a12,
a21, a22.
Instances'
codes have the
following meaning: R2d-01 — instance from class R2d,
unique number 01.