Gurobi 5.0.1 (linux64) logging started Sat Nov 17 23:57:00 2012 Optimize a model with 1 rows, 49 columns and 49 nonzeros Model has 135 quadratic objective terms Modified 48 Q diagonals Presolve time: 0.01s Presolved: 1 rows, 49 columns, 49 nonzeros Presolved model has 183 quadratic objective terms Variable types: 0 continuous, 49 integer (49 binary) Found heuristic solution: objective 71.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 71.00000 0.00000 100% - 0s H 0 0 57.0000000 0.00000 100% - 0s H 0 0 50.0000000 0.00000 100% - 0s H 0 0 43.0000000 0.00000 100% - 0s H 0 0 41.0000000 0.00000 100% - 0s H 0 0 40.0000000 0.00000 100% - 0s H 0 0 38.0000000 0.00000 100% - 0s 0 2 0.00000 0 48 38.00000 0.00000 100% - 0s H 23 23 37.0000000 2.22061 94.0% 2.7 0s H 25 25 36.0000000 2.22061 93.8% 2.7 0s H 391 324 35.0000000 5.59718 84.0% 2.6 0s H 432 357 34.0000000 5.59718 83.5% 2.6 0s H 657 465 32.0000000 6.24170 80.5% 2.6 0s H20704 9223 31.0000000 20.45267 34.0% 2.5 1s 57370 18853 27.16399 32 27 31.00000 23.32341 24.8% 2.4 5s 114653 25479 29.75094 33 28 31.00000 25.36967 18.2% 2.4 10s 172067 23160 28.59163 29 32 31.00000 26.75894 13.7% 2.4 15s 230099 10281 28.43831 30 27 31.00000 28.43831 8.26% 2.4 20s Explored 247957 nodes (602064 simplex iterations) in 21.65 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%