Gurobi 5.0.1 (linux64) logging started Sun Nov 18 05:42:40 2012

Optimize a model with 1 rows, 175 columns and 175 nonzeros
Model has 160 quadratic objective terms
Presolve removed 0 rows and 28 columns
Presolve time: 0.00s
Presolved: 161 rows, 307 columns, 627 nonzeros
Variable types: 0 continuous, 307 integer (306 binary)
Found heuristic solution: objective 51.0000000

Root relaxation: objective 0.000000e+00, 196 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   38   51.00000    0.00000   100%     -    0s
H    0     0                      37.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   44   37.00000    0.00000   100%     -    0s
H    0     0                      36.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   27   36.00000    0.00000   100%     -    0s
H    0     0                      19.0000000    0.00000   100%     -    0s
H    0     0                      18.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   21   18.00000    0.00000   100%     -    0s
H    0     0                      14.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   25   14.00000    0.00000   100%     -    0s
H    0     0                      13.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   24   13.00000    0.00000   100%     -    0s
     0     0    0.00000    0   24   13.00000    0.00000   100%     -    0s
     0     0    0.00000    0   25   13.00000    0.00000   100%     -    0s
     0     0    0.00000    0   25   13.00000    0.00000   100%     -    0s
     0     2    0.00000    0   25   13.00000    0.00000   100%     -    0s
H  598   249                       8.0000000    0.00000   100%   7.3    0s
H  680   241                       7.0000000    0.31818  95.5%   9.6    0s
H  825   119                       6.0000000    3.00000  50.0%  19.2    0s

Cutting planes:
  Cover: 305
  MIR: 1

Explored 945 nodes (24248 simplex iterations) in 0.49 seconds
Thread count was 1 (of 16 available processors)

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