Gurobi 5.0.1 (linux64) logging started Sun Nov 18 00:09:16 2012

Optimize a model with 1 rows, 50 columns and 50 nonzeros
Model has 124 quadratic objective terms
Modified 50 Q diagonals
Presolve time: 0.01s
Presolved: 1 rows, 50 columns, 50 nonzeros
Presolved model has 174 quadratic objective terms
Variable types: 0 continuous, 50 integer (50 binary)
Found heuristic solution: objective 69.0000000

Root relaxation: objective 0.000000e+00, 52 iterations, 0.00 seconds

    Nodes    |    Current Node    |     Objective Bounds      |     Work
 Expl Unexpl |  Obj  Depth IntInf | Incumbent    BestBd   Gap | It/Node Time

     0     0    0.00000    0   50   69.00000    0.00000   100%     -    0s
H    0     0                      57.0000000    0.00000   100%     -    0s
H    0     0                      54.0000000    0.00000   100%     -    0s
H    0     0                      50.0000000    0.00000   100%     -    0s
H    0     0                      31.0000000    0.00000   100%     -    0s
     0     2    2.53556    0   50   31.00000    2.53556  91.8%     -    0s
H  631   448                      30.0000000    6.89434  77.0%   2.9    0s
H  632   427                      29.0000000    6.89434  76.2%   2.9    0s
H 1286   568                      28.0000000   10.78806  61.5%   2.8    0s
 59151 17707   26.17297   28   34   28.00000   21.64663  22.7%   2.6    5s
 118290 22416   25.02685   28   32   28.00000   23.35465  16.6%   2.6   10s
 177181 16768   26.51433   27   34   28.00000   24.72591  11.7%   2.6   15s

Explored 222083 nodes (584984 simplex iterations) in 18.86 seconds
Thread count was 1 (of 16 available processors)

Optimal solution found (tolerance 1.00e-04)
Best objective 2.800000000000e+01, best bound 2.800000000000e+01, gap 0.0%