Gurobi 5.0.1 (linux64) logging started Sat Nov 17 20:30:28 2012

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

Root relaxation: objective 0.000000e+00, 31 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   29  102.00000    0.00000   100%     -    0s
H    0     0                      99.0000000    0.00000   100%     -    0s
H    0     0                      96.0000000    0.00000   100%     -    0s
H    0     0                      83.0000000    0.00000   100%     -    0s
H    0     0                      80.0000000    0.00000   100%     -    0s
     0     2    2.38473    0   29   80.00000    2.38473  97.0%     -    0s
*  485   401              18      79.0000000   13.78018  82.6%   2.0    0s
H  791   533                      75.0000000   18.26028  75.7%   2.1    0s
 69581 23285   54.24487   23   17   75.00000   54.24487  27.7%   2.0    5s
 141663 36563   73.45723   30   10   75.00000   58.65349  21.8%   2.0   10s
 210199 43731   72.07418   28   12   75.00000   61.30136  18.3%   2.0   15s
 279069 46117   73.40293   31    9   75.00000   63.17283  15.8%   2.0   20s
 348626 43773   64.71384   28   12   75.00000   64.71384  13.7%   2.0   25s
 419818 36815   68.45266   26   14   75.00000   66.25467  11.7%   2.0   30s
 489522 24493   73.33368   31    9   75.00000   68.26683  8.98%   2.0   35s

Explored 551569 nodes (1105629 simplex iterations) in 39.76 seconds
Thread count was 1 (of 16 available processors)

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