Gurobi 5.0.1 (linux64) logging started Fri Nov 16 01:24:34 2012 Optimize a model with 5376 rows, 812 columns and 16828 nonzeros Presolve time: 0.05s Presolved: 5376 rows, 812 columns, 24219 nonzeros Variable types: 0 continuous, 812 integer (812 binary) Found heuristic solution: objective 16.0000000 Root relaxation: objective 2.000000e+00, 793 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2.00000 0 56 16.00000 2.00000 87.5% - 0s H 0 0 12.0000000 2.00000 83.3% - 0s H 0 0 10.0000000 2.00000 80.0% - 0s 0 0 2.00000 0 56 10.00000 2.00000 80.0% - 0s 0 0 2.00000 0 56 10.00000 2.00000 80.0% - 0s H 0 0 9.0000000 2.00000 77.8% - 0s 0 0 2.00000 0 56 9.00000 2.00000 77.8% - 0s H 0 0 8.0000000 2.00000 75.0% - 0s 0 0 2.00000 0 56 8.00000 2.00000 75.0% - 1s 0 0 2.00000 0 56 8.00000 2.00000 75.0% - 1s 0 0 2.00000 0 56 8.00000 2.00000 75.0% - 1s H 0 0 7.0000000 2.00000 71.4% - 2s 0 2 2.00000 0 56 7.00000 2.00000 71.4% - 2s 71 35 cutoff 13 7.00000 3.50000 50.0% 350 5s 403 131 6.00000 4 75 7.00000 5.00000 28.6% 183 10s 606 187 6.00000 17 18 7.00000 6.00000 14.3% 160 15s 615 197 6.00000 31 130 7.00000 6.00000 14.3% 206 20s 635 202 6.00000 40 53 7.00000 6.00000 14.3% 216 25s 740 172 6.00000 40 61 7.00000 6.00000 14.3% 242 30s 809 146 6.00000 40 48 7.00000 6.00000 14.3% 276 35s 915 111 6.00000 41 102 7.00000 6.00000 14.3% 285 40s 997 91 6.00000 41 54 7.00000 6.00000 14.3% 299 45s 1108 55 6.00000 42 50 7.00000 6.00000 14.3% 307 50s 1198 16 infeasible 43 7.00000 6.00000 14.3% 321 55s 1228 14 6.00000 40 49 7.00000 6.00000 14.3% 355 60s 1328 16 6.00000 42 76 7.00000 6.00000 14.3% 362 65s 1414 14 6.00000 40 56 7.00000 6.00000 14.3% 371 70s 1522 10 infeasible 44 7.00000 6.00000 14.3% 375 75s 1625 14 6.00000 40 45 7.00000 6.00000 14.3% 379 80s 1736 19 6.00000 44 55 7.00000 6.00000 14.3% 380 85s 1903 10 6.00000 40 46 7.00000 6.00000 14.3% 375 90s 2014 7 infeasible 42 7.00000 6.00000 14.3% 375 95s 2093 8 infeasible 41 7.00000 6.00000 14.3% 386 100s 2167 8 6.00000 38 70 7.00000 6.00000 14.3% 393 105s 2256 15 6.00000 40 55 7.00000 6.00000 14.3% 397 110s 2300 13 6.00000 40 71 7.00000 6.00000 14.3% 410 115s 2413 16 infeasible 44 7.00000 6.00000 14.3% 408 120s 2480 7 6.00000 39 56 7.00000 6.00000 14.3% 417 125s Explored 2646 nodes (1096422 simplex iterations) in 129.71 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 7.000000000000e+00, best bound 7.000000000000e+00, gap 0.0%