Gurobi 5.0.1 (linux64) logging started Sat Nov 17 20:18:14 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 96.0000000 0.00000 100% - 0s H 0 0 95.0000000 0.00000 100% - 0s H 0 0 85.0000000 0.00000 100% - 0s 0 2 3.60671 0 28 85.00000 3.60671 95.8% - 0s H 8 8 76.0000000 7.75945 89.8% 1.8 0s H 95 74 75.0000000 10.88761 85.5% 2.0 0s H 792 512 73.0000000 17.08523 76.6% 2.0 0s H13158 6086 72.0000000 40.10072 44.3% 2.0 0s 88464 29186 58.27768 30 13 72.00000 52.21770 27.5% 2.0 5s 176579 44094 68.23474 34 9 72.00000 56.72614 21.2% 2.0 10s 259744 50893 67.01416 33 10 72.00000 59.20461 17.8% 2.0 15s 346782 51264 69.86522 33 10 72.00000 61.07781 15.2% 2.0 20s 431471 45279 70.00989 34 9 72.00000 62.71639 12.9% 2.0 25s 516678 33016 66.78477 32 11 72.00000 64.50709 10.4% 2.0 30s 601788 8740 68.40424 33 10 72.00000 68.40424 4.99% 2.0 35s Explored 614413 nodes (1237610 simplex iterations) in 35.94 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 7.200000000000e+01, best bound 7.200000000000e+01, gap 0.0%