Gurobi 5.0.1 (linux64) logging started Sat Nov 17 23:52:25 2012 Optimize a model with 1 rows, 48 columns and 48 nonzeros Model has 128 quadratic objective terms Modified 48 Q diagonals Presolve time: 0.01s Presolved: 1 rows, 48 columns, 48 nonzeros Presolved model has 176 quadratic objective terms Variable types: 0 continuous, 48 integer (48 binary) Found heuristic solution: objective 65.0000000 Root relaxation: objective 0.000000e+00, 49 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 65.00000 0.00000 100% - 0s H 0 0 59.0000000 0.00000 100% - 0s H 0 0 53.0000000 0.00000 100% - 0s H 0 0 46.0000000 0.00000 100% - 0s H 0 0 36.0000000 0.00000 100% - 0s 0 2 1.88887 0 48 36.00000 1.88887 94.8% - 0s H 9 9 35.0000000 3.21238 90.8% 1.8 0s H 541 435 33.0000000 5.82698 82.3% 2.4 0s H 1002 665 32.0000000 8.26441 74.2% 2.6 0s H 1111 635 31.0000000 8.40021 72.9% 2.5 0s 61829 25337 26.91954 27 31 31.00000 22.27428 28.1% 2.4 5s 124839 40857 29.52797 38 15 31.00000 24.03829 22.5% 2.4 10s 187515 50668 27.76488 25 33 31.00000 25.09115 19.1% 2.4 15s 249290 55235 28.14456 27 29 31.00000 25.83310 16.7% 2.4 20s 311632 55123 29.32627 28 26 31.00000 26.47654 14.6% 2.4 25s 374582 50123 29.96682 30 28 31.00000 27.07251 12.7% 2.4 30s 437171 40182 27.70491 27 30 31.00000 27.69683 10.7% 2.4 35s 500788 23251 29.59547 30 26 31.00000 28.52659 7.98% 2.4 40s Explored 543558 nodes (1330330 simplex iterations) in 43.62 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.100000000000e+01, best bound 3.100000000000e+01, gap 0.0%