Instances for general quadratic integer programming problem with and without linear (resource) constraints

There are two sets of instances: 1) general quadratic integer programming problem with linear (resource) constraints; 2) general quadratic integer programming problem without linear constraints;
<BR>
For general quadratic integer programming problem with linear resource constraints,
<BR>
Max f(x) =dx + xqx
<BR>
s.t. ax <= b; (resource constraints: such as people, equipment, material, and budget)
<BR>
0<=x <=u; (lower and upper bounds of decision variables)
<BR>
the name of instance is nxxxmyyytt-zzz-in.txt:<BR>

xxx is the size of decision variables;<BR>

yyy is the number of linear resource constraints where yyy=0.2*xxx or 0.5*xxx;<BR>

tt='e' is the type of instance with large slack value of 'b' <br>
tt='d' is the type of instance with medium slack value of 'b' <br>
tt='h' is the type of instance with small slack value of 'b' <br>

zzz is the type of instances, zzz =1, 2, 3, 4, and 5<BR>

For zzz=1, the range of value for d and q elements is -20 to 20, the upper bound of decision variable is 10, the range of value for a is 0 to 9<BR>

For zzz=2, the range of value for d and q elements is -40 to 40, the upper bound of decision variable is 20, the range of value for a is 0 to 19<BR>

For zzz=3, the range of value for d and q elements is -80 to 80, the upper bound of decision variable is 40, the range of value for a is 0 to 39<BR>

For zzz=4, the range of value for d and q elements is -160 to 160, the upper bound of decision variable is 80, the range of value for a is 0 to 79<BR>

For zzz=5, the range of value for d and q elements is -200 to 200, the upper bound of decision variable is 100, the range of value for a is 0 to 99<BR>

for each instance, the input file format is:<BR>
name of instance<BR>
number of variables n, number of knapsack constraints m<BR>
the linear coefficients of the objective function, d<BR>
blank line<BR>
the quadratic coefficients of the objective function, q,<BR>
blank line<BR>
the right hand size of source constraints, b <BR>
the coefficients of source constraints, a<BR>
blank line<BR>
the upper bound of decision variable, u<BR>
<BR>
<BR>
For general quadratic integer programming problem without linear resource constraints:<BR>
Max f(x) =dx + xqx<BR>
s.t. 0<=x <=u; <BR>

the name of instance is nxxx-zzz-in.txt:<BR>
xxx is the size of decision variables;<BR>
zzz is the type of instances, zzz =1, 2, 3, 4, and 5<BR>
For zzz=1, the range of value for d and q elements is -20 to 20, the upper bound of decision variable is 10;<BR>
For zzz=2, the range of value for d and q elements is -40 to 40, the upper bound of decision variable is 20;<BR>
For zzz=3, the range of value for d and q elements is -80 to 80, the upper bound of decision variable is 40;<BR>
For zzz=4, the range of value for d and q elements is -160 to 160, the upper bound of decision variable is 80;<BR>
For zzz=5, the range of value for d and q elements is -200 to 200, the upper bound of decision variable is 100; <BR>

for each instance, the input file format using is:<BR>
name of instance<BR>
number of variables n<BR>
the linear coefficients of the objective function, d<BR>
blank line<BR>
the quadratic coefficients of the objective function, q<BR>
blank line<BR>
the upper bound of decision variable, u<BR>