Gurobi 5.0.1 (linux64) logging started Sat Nov 17 23:57:39 2012 Optimize a model with 1 rows, 49 columns and 49 nonzeros Model has 123 quadratic objective terms Modified 48 Q diagonals Presolve time: 0.01s Presolved: 1 rows, 49 columns, 49 nonzeros Presolved model has 171 quadratic objective terms Variable types: 0 continuous, 49 integer (49 binary) Found heuristic solution: objective 64.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 48 64.00000 0.00000 100% - 0s H 0 0 48.0000000 0.00000 100% - 0s H 0 0 46.0000000 0.00000 100% - 0s H 0 0 44.0000000 0.00000 100% - 0s H 0 0 37.0000000 0.00000 100% - 0s H 0 0 34.0000000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 2 0.00000 0 48 31.00000 0.00000 100% - 0s H 628 454 29.0000000 6.84387 76.4% 2.7 0s 64711 24574 27.68204 30 30 29.00000 21.27466 26.6% 2.5 5s 129858 39347 27.30513 33 23 29.00000 22.78809 21.4% 2.5 10s 194131 48239 27.43825 36 21 29.00000 23.67090 18.4% 2.5 15s 257937 52100 24.55918 32 26 29.00000 24.32099 16.1% 2.5 20s 322042 51158 27.49877 29 29 29.00000 24.87748 14.2% 2.5 25s 386537 45654 27.57460 33 25 29.00000 25.40176 12.4% 2.5 30s 450795 34696 27.80248 33 27 29.00000 26.00470 10.3% 2.5 35s 514540 14877 27.07799 32 28 29.00000 26.98087 6.96% 2.5 40s Explored 537157 nodes (1351418 simplex iterations) in 41.98 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 2.900000000000e+01, best bound 2.900000000000e+01, gap 0.0%