Gurobi 5.0.1 (linux64) logging started Sun Nov 18 00:11:41 2012 Optimize a model with 1 rows, 50 columns and 50 nonzeros Model has 134 quadratic objective terms Modified 50 Q diagonals Presolve time: 0.01s Presolved: 1 rows, 50 columns, 50 nonzeros Presolved model has 184 quadratic objective terms Variable types: 0 continuous, 50 integer (50 binary) Found heuristic solution: objective 70.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 50 70.00000 0.00000 100% - 0s H 0 0 54.0000000 0.00000 100% - 0s H 0 0 51.0000000 0.00000 100% - 0s H 0 0 44.0000000 0.00000 100% - 0s H 0 0 41.0000000 0.00000 100% - 0s H 0 0 38.0000000 0.00000 100% - 0s H 0 0 35.0000000 0.00000 100% - 0s H 0 0 33.0000000 0.00000 100% - 0s 0 2 1.94650 0 50 33.00000 1.94650 94.1% - 0s H 648 478 32.0000000 7.14253 77.7% 2.4 0s H 659 463 31.0000000 7.14253 77.0% 2.4 0s H 4069 2096 30.0000000 15.32376 48.9% 2.4 0s 57868 21174 23.79793 26 36 30.00000 22.39386 25.4% 2.3 5s 115993 31539 28.08263 32 28 30.00000 24.21099 19.3% 2.3 10s 174177 34918 28.67187 31 30 30.00000 25.31664 15.6% 2.3 15s 232464 31320 26.21141 26 35 30.00000 26.20937 12.6% 2.4 20s 290920 20788 27.11667 28 34 30.00000 27.11667 9.61% 2.4 25s Explored 337977 nodes (798949 simplex iterations) in 29.28 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 3.000000000000e+01, best bound 3.000000000000e+01, gap 0.0%