Gurobi 5.0.1 (linux64) logging started Sat Nov 17 20:18:50 2012

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

Root relaxation: objective 0.000000e+00, 30 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   28  101.00000    0.00000   100%     -    0s
H    0     0                      90.0000000    0.00000   100%     -    0s
H    0     0                      85.0000000    0.00000   100%     -    0s
     0     2    3.62464    0   28   85.00000    3.62464  95.7%     -    0s
H   12    12                      80.0000000    6.97415  91.3%   1.8    0s
H   48    36                      77.0000000    6.97415  90.9%   2.0    0s
*  443   372              18      76.0000000   14.58712  80.8%   2.0    0s
* 1567   731              39      74.0000000   27.08632  63.4%   2.0    0s
H15001  6949                      73.0000000   44.16217  39.5%   2.0    0s
 85166 28131   54.87858   30   13   73.00000   54.87858  24.8%   2.0    5s
 177756 43211   59.26812   29   14   73.00000   59.26812  18.8%   2.0   10s
 267534 49245   66.08708   33   10   73.00000   61.77839  15.4%   2.0   15s
 360537 46640   63.70980   31   12   73.00000   63.70980  12.7%   2.0   20s
 453747 35496   65.67676   32   11   73.00000   65.67676  10.0%   2.0   25s
 546118 11122   71.75318   34    9   73.00000   69.13876  5.29%   2.0   30s

Explored 563758 nodes (1132531 simplex iterations) in 31.25 seconds
Thread count was 1 (of 16 available processors)

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